./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:33:11,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:33:12,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:33:12,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:33:12,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:33:12,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:33:12,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:33:12,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:33:12,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:33:12,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:33:12,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:33:12,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:33:12,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:33:12,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:33:12,059 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:33:12,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:33:12,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:33:12,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:33:12,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:33:12,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:33:12,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:33:12,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:33:12,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:33:12,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:33:12,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:33:12,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:33:12,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:33:12,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:33:12,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:33:12,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:33:12,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:33:12,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:33:12,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:33:12,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:33:12,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:33:12,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:33:12,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:33:12,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:33:12,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:33:12,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:33:12,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:33:12,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:33:12,069 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2024-11-09 18:33:12,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:33:12,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:33:12,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:33:12,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:33:12,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:33:12,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2024-11-09 18:33:13,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:33:13,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:33:13,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-11-09 18:33:13,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a19af742/bfe37614a1844befa131447667b30ab8/FLAG054aefde3 [2024-11-09 18:33:13,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a19af742/bfe37614a1844befa131447667b30ab8 [2024-11-09 18:33:13,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:33:13,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:33:13,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:33:13,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:33:13,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:33:13,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:13" (1/1) ... [2024-11-09 18:33:13,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64de1069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:13, skipping insertion in model container [2024-11-09 18:33:13,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:13" (1/1) ... [2024-11-09 18:33:13,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:33:14,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2024-11-09 18:33:14,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:33:14,205 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:33:14,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2024-11-09 18:33:14,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:33:14,261 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:33:14,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14 WrapperNode [2024-11-09 18:33:14,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:33:14,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:33:14,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:33:14,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:33:14,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,299 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 159 [2024-11-09 18:33:14,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:33:14,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:33:14,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:33:14,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:33:14,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,343 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 18:33:14,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:33:14,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:33:14,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:33:14,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:33:14,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (1/1) ... [2024-11-09 18:33:14,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:33:14,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:33:14,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:33:14,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:33:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:33:14,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:33:14,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:33:14,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:33:14,517 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:33:14,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:33:14,784 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-09 18:33:14,784 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:33:14,801 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:33:14,801 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:33:14,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:14 BoogieIcfgContainer [2024-11-09 18:33:14,802 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:33:14,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:33:14,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:33:14,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:33:14,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:33:13" (1/3) ... [2024-11-09 18:33:14,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4c512b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:14, skipping insertion in model container [2024-11-09 18:33:14,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:14" (2/3) ... [2024-11-09 18:33:14,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4c512b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:14, skipping insertion in model container [2024-11-09 18:33:14,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:14" (3/3) ... [2024-11-09 18:33:14,813 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2024-11-09 18:33:14,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:33:14,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:33:14,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:33:14,925 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;@17d8b66e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:33:14,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:33:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 18:33:14,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:14,938 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] [2024-11-09 18:33:14,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:14,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1041408426, now seen corresponding path program 1 times [2024-11-09 18:33:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:14,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042040961] [2024-11-09 18:33:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:15,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:15,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042040961] [2024-11-09 18:33:15,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042040961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:15,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:15,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195407215] [2024-11-09 18:33:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:15,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:15,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:15,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,204 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 45 states have internal predecessors, (81), 0 states have call successors, (0), 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 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:15,241 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2024-11-09 18:33:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 18:33:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:15,257 INFO L225 Difference]: With dead ends: 93 [2024-11-09 18:33:15,258 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 18:33:15,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,264 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:15,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 155 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 18:33:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2024-11-09 18:33:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 52 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 96 transitions. [2024-11-09 18:33:15,301 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 96 transitions. Word has length 20 [2024-11-09 18:33:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:15,301 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 96 transitions. [2024-11-09 18:33:15,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 96 transitions. [2024-11-09 18:33:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 18:33:15,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:15,304 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] [2024-11-09 18:33:15,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:33:15,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1746007061, now seen corresponding path program 1 times [2024-11-09 18:33:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395842728] [2024-11-09 18:33:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395842728] [2024-11-09 18:33:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395842728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:15,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028744051] [2024-11-09 18:33:15,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:15,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,431 INFO L87 Difference]: Start difference. First operand 53 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:15,470 INFO L93 Difference]: Finished difference Result 130 states and 235 transitions. [2024-11-09 18:33:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:15,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 18:33:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:15,474 INFO L225 Difference]: With dead ends: 130 [2024-11-09 18:33:15,474 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 18:33:15,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,478 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 162 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-11-09 18:33:15,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 18:33:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-11-09 18:33:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 75 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2024-11-09 18:33:15,492 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 20 [2024-11-09 18:33:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:15,493 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2024-11-09 18:33:15,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2024-11-09 18:33:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 18:33:15,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:15,496 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] [2024-11-09 18:33:15,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:33:15,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2075207422, now seen corresponding path program 1 times [2024-11-09 18:33:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:15,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775986954] [2024-11-09 18:33:15,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:15,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:15,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:15,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775986954] [2024-11-09 18:33:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775986954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:15,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:15,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767555535] [2024-11-09 18:33:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:15,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:15,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,585 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:15,612 INFO L93 Difference]: Finished difference Result 121 states and 211 transitions. [2024-11-09 18:33:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:15,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-09 18:33:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:15,615 INFO L225 Difference]: With dead ends: 121 [2024-11-09 18:33:15,616 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 18:33:15,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,618 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 57 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:15,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 18:33:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-09 18:33:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.7721518987341771) internal successors, (140), 79 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2024-11-09 18:33:15,634 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 21 [2024-11-09 18:33:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:15,636 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2024-11-09 18:33:15,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2024-11-09 18:33:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 18:33:15,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:15,637 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] [2024-11-09 18:33:15,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:33:15,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:15,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1709225697, now seen corresponding path program 1 times [2024-11-09 18:33:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235134562] [2024-11-09 18:33:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:15,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:15,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235134562] [2024-11-09 18:33:15,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235134562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:15,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24007436] [2024-11-09 18:33:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:15,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:15,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:15,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,683 INFO L87 Difference]: Start difference. First operand 80 states and 140 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:15,713 INFO L93 Difference]: Finished difference Result 153 states and 269 transitions. [2024-11-09 18:33:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-09 18:33:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:15,716 INFO L225 Difference]: With dead ends: 153 [2024-11-09 18:33:15,717 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 18:33:15,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,719 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 52 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:15,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 18:33:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 105. [2024-11-09 18:33:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.7788461538461537) internal successors, (185), 104 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 185 transitions. [2024-11-09 18:33:15,737 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 185 transitions. Word has length 21 [2024-11-09 18:33:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 185 transitions. [2024-11-09 18:33:15,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 185 transitions. [2024-11-09 18:33:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 18:33:15,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:15,741 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] [2024-11-09 18:33:15,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:33:15,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:15,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1078189790, now seen corresponding path program 1 times [2024-11-09 18:33:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:15,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704157540] [2024-11-09 18:33:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:15,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704157540] [2024-11-09 18:33:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704157540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460451671] [2024-11-09 18:33:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:15,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,800 INFO L87 Difference]: Start difference. First operand 105 states and 185 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:15,824 INFO L93 Difference]: Finished difference Result 251 states and 445 transitions. [2024-11-09 18:33:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-09 18:33:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:15,825 INFO L225 Difference]: With dead ends: 251 [2024-11-09 18:33:15,825 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 18:33:15,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,826 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 163 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-11-09 18:33:15,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 18:33:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2024-11-09 18:33:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.7635135135135136) internal successors, (261), 148 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 261 transitions. [2024-11-09 18:33:15,845 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 261 transitions. Word has length 21 [2024-11-09 18:33:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:15,846 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 261 transitions. [2024-11-09 18:33:15,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 261 transitions. [2024-11-09 18:33:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 18:33:15,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:15,847 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] [2024-11-09 18:33:15,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:33:15,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:15,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1447252068, now seen corresponding path program 1 times [2024-11-09 18:33:15,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:15,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515794173] [2024-11-09 18:33:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:15,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:15,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515794173] [2024-11-09 18:33:15,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515794173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:15,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750609348] [2024-11-09 18:33:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:15,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:15,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,895 INFO L87 Difference]: Start difference. First operand 149 states and 261 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:15,917 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2024-11-09 18:33:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:15,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-09 18:33:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:15,918 INFO L225 Difference]: With dead ends: 226 [2024-11-09 18:33:15,918 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 18:33:15,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,920 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:15,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 18:33:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-11-09 18:33:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.74) internal successors, (261), 150 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 261 transitions. [2024-11-09 18:33:15,927 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 261 transitions. Word has length 22 [2024-11-09 18:33:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:15,928 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 261 transitions. [2024-11-09 18:33:15,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 261 transitions. [2024-11-09 18:33:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 18:33:15,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:15,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] [2024-11-09 18:33:15,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:33:15,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:15,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash 936717891, now seen corresponding path program 1 times [2024-11-09 18:33:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:15,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359288179] [2024-11-09 18:33:15,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:15,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359288179] [2024-11-09 18:33:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359288179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:15,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478872571] [2024-11-09 18:33:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:15,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:15,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:15,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,967 INFO L87 Difference]: Start difference. First operand 151 states and 261 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:15,986 INFO L93 Difference]: Finished difference Result 285 states and 497 transitions. [2024-11-09 18:33:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:15,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-09 18:33:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:15,987 INFO L225 Difference]: With dead ends: 285 [2024-11-09 18:33:15,988 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 18:33:15,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:15,990 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:15,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 18:33:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 203. [2024-11-09 18:33:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.7277227722772277) internal successors, (349), 202 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 349 transitions. [2024-11-09 18:33:15,999 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 349 transitions. Word has length 22 [2024-11-09 18:33:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:15,999 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 349 transitions. [2024-11-09 18:33:15,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 349 transitions. [2024-11-09 18:33:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 18:33:16,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,001 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] [2024-11-09 18:33:16,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:33:16,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1850697596, now seen corresponding path program 1 times [2024-11-09 18:33:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551770732] [2024-11-09 18:33:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551770732] [2024-11-09 18:33:16,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551770732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304738666] [2024-11-09 18:33:16,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,040 INFO L87 Difference]: Start difference. First operand 203 states and 349 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,055 INFO L93 Difference]: Finished difference Result 485 states and 837 transitions. [2024-11-09 18:33:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-09 18:33:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,061 INFO L225 Difference]: With dead ends: 485 [2024-11-09 18:33:16,061 INFO L226 Difference]: Without dead ends: 290 [2024-11-09 18:33:16,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,064 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 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-11-09 18:33:16,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-09 18:33:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-11-09 18:33:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.7097902097902098) internal successors, (489), 286 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 489 transitions. [2024-11-09 18:33:16,086 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 489 transitions. Word has length 22 [2024-11-09 18:33:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,087 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 489 transitions. [2024-11-09 18:33:16,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 489 transitions. [2024-11-09 18:33:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 18:33:16,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,092 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] [2024-11-09 18:33:16,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:33:16,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1025660165, now seen corresponding path program 1 times [2024-11-09 18:33:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577615553] [2024-11-09 18:33:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577615553] [2024-11-09 18:33:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577615553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49902503] [2024-11-09 18:33:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,142 INFO L87 Difference]: Start difference. First operand 287 states and 489 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,160 INFO L93 Difference]: Finished difference Result 433 states and 733 transitions. [2024-11-09 18:33:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-09 18:33:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,165 INFO L225 Difference]: With dead ends: 433 [2024-11-09 18:33:16,165 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 18:33:16,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,166 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:16,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 18:33:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2024-11-09 18:33:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.686206896551724) internal successors, (489), 290 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 489 transitions. [2024-11-09 18:33:16,180 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 489 transitions. Word has length 23 [2024-11-09 18:33:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,180 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 489 transitions. [2024-11-09 18:33:16,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 489 transitions. [2024-11-09 18:33:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 18:33:16,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,181 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] [2024-11-09 18:33:16,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:33:16,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1536194342, now seen corresponding path program 1 times [2024-11-09 18:33:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285209609] [2024-11-09 18:33:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285209609] [2024-11-09 18:33:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285209609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168141543] [2024-11-09 18:33:16,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,214 INFO L87 Difference]: Start difference. First operand 291 states and 489 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,232 INFO L93 Difference]: Finished difference Result 541 states and 921 transitions. [2024-11-09 18:33:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-09 18:33:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,236 INFO L225 Difference]: With dead ends: 541 [2024-11-09 18:33:16,236 INFO L226 Difference]: Without dead ends: 538 [2024-11-09 18:33:16,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,237 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:16,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-09 18:33:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 399. [2024-11-09 18:33:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.6608040201005025) internal successors, (661), 398 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 661 transitions. [2024-11-09 18:33:16,255 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 661 transitions. Word has length 23 [2024-11-09 18:33:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,257 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 661 transitions. [2024-11-09 18:33:16,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 661 transitions. [2024-11-09 18:33:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 18:33:16,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:16,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:33:16,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash -28642533, now seen corresponding path program 1 times [2024-11-09 18:33:16,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852397521] [2024-11-09 18:33:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852397521] [2024-11-09 18:33:16,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852397521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510829227] [2024-11-09 18:33:16,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,294 INFO L87 Difference]: Start difference. First operand 399 states and 661 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,319 INFO L93 Difference]: Finished difference Result 949 states and 1577 transitions. [2024-11-09 18:33:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-09 18:33:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,322 INFO L225 Difference]: With dead ends: 949 [2024-11-09 18:33:16,323 INFO L226 Difference]: Without dead ends: 562 [2024-11-09 18:33:16,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,324 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 165 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-11-09 18:33:16,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-09 18:33:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2024-11-09 18:33:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.6433691756272402) internal successors, (917), 558 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 917 transitions. [2024-11-09 18:33:16,341 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 917 transitions. Word has length 23 [2024-11-09 18:33:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,342 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 917 transitions. [2024-11-09 18:33:16,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 917 transitions. [2024-11-09 18:33:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 18:33:16,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,345 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] [2024-11-09 18:33:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 18:33:16,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash -376534787, now seen corresponding path program 1 times [2024-11-09 18:33:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250770388] [2024-11-09 18:33:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250770388] [2024-11-09 18:33:16,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250770388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077361537] [2024-11-09 18:33:16,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,379 INFO L87 Difference]: Start difference. First operand 559 states and 917 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,398 INFO L93 Difference]: Finished difference Result 841 states and 1373 transitions. [2024-11-09 18:33:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-09 18:33:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,402 INFO L225 Difference]: With dead ends: 841 [2024-11-09 18:33:16,403 INFO L226 Difference]: Without dead ends: 570 [2024-11-09 18:33:16,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,405 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:16,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-09 18:33:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 567. [2024-11-09 18:33:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 1.6201413427561837) internal successors, (917), 566 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 917 transitions. [2024-11-09 18:33:16,422 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 917 transitions. Word has length 24 [2024-11-09 18:33:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,422 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 917 transitions. [2024-11-09 18:33:16,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 917 transitions. [2024-11-09 18:33:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 18:33:16,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,423 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] [2024-11-09 18:33:16,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 18:33:16,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -887068964, now seen corresponding path program 1 times [2024-11-09 18:33:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061683021] [2024-11-09 18:33:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061683021] [2024-11-09 18:33:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061683021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292876] [2024-11-09 18:33:16,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,456 INFO L87 Difference]: Start difference. First operand 567 states and 917 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,480 INFO L93 Difference]: Finished difference Result 1037 states and 1705 transitions. [2024-11-09 18:33:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-09 18:33:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,485 INFO L225 Difference]: With dead ends: 1037 [2024-11-09 18:33:16,485 INFO L226 Difference]: Without dead ends: 1034 [2024-11-09 18:33:16,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,488 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 43 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:16,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-09 18:33:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 791. [2024-11-09 18:33:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.5860759493670886) internal successors, (1253), 790 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1253 transitions. [2024-11-09 18:33:16,512 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1253 transitions. Word has length 24 [2024-11-09 18:33:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,513 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1253 transitions. [2024-11-09 18:33:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1253 transitions. [2024-11-09 18:33:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 18:33:16,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,514 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] [2024-11-09 18:33:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 18:33:16,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash 620482845, now seen corresponding path program 1 times [2024-11-09 18:33:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515864171] [2024-11-09 18:33:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515864171] [2024-11-09 18:33:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515864171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058774717] [2024-11-09 18:33:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,545 INFO L87 Difference]: Start difference. First operand 791 states and 1253 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,578 INFO L93 Difference]: Finished difference Result 1869 states and 2969 transitions. [2024-11-09 18:33:16,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-09 18:33:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,583 INFO L225 Difference]: With dead ends: 1869 [2024-11-09 18:33:16,583 INFO L226 Difference]: Without dead ends: 1098 [2024-11-09 18:33:16,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,584 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 166 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-11-09 18:33:16,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-09 18:33:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1095. [2024-11-09 18:33:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.5694698354661791) internal successors, (1717), 1094 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1717 transitions. [2024-11-09 18:33:16,616 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1717 transitions. Word has length 24 [2024-11-09 18:33:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,617 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1717 transitions. [2024-11-09 18:33:16,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1717 transitions. [2024-11-09 18:33:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 18:33:16,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,619 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] [2024-11-09 18:33:16,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 18:33:16,619 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1728491276, now seen corresponding path program 1 times [2024-11-09 18:33:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434558082] [2024-11-09 18:33:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434558082] [2024-11-09 18:33:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434558082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843759209] [2024-11-09 18:33:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,645 INFO L87 Difference]: Start difference. First operand 1095 states and 1717 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,673 INFO L93 Difference]: Finished difference Result 1645 states and 2569 transitions. [2024-11-09 18:33:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-09 18:33:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,678 INFO L225 Difference]: With dead ends: 1645 [2024-11-09 18:33:16,678 INFO L226 Difference]: Without dead ends: 1114 [2024-11-09 18:33:16,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,680 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:16,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-09 18:33:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1111. [2024-11-09 18:33:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 1.5468468468468468) internal successors, (1717), 1110 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1717 transitions. [2024-11-09 18:33:16,726 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1717 transitions. Word has length 25 [2024-11-09 18:33:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1717 transitions. [2024-11-09 18:33:16,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1717 transitions. [2024-11-09 18:33:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 18:33:16,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,728 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] [2024-11-09 18:33:16,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 18:33:16,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2055941843, now seen corresponding path program 1 times [2024-11-09 18:33:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389678332] [2024-11-09 18:33:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389678332] [2024-11-09 18:33:16,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389678332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935750878] [2024-11-09 18:33:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,760 INFO L87 Difference]: Start difference. First operand 1111 states and 1717 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,823 INFO L93 Difference]: Finished difference Result 3229 states and 4953 transitions. [2024-11-09 18:33:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-09 18:33:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,831 INFO L225 Difference]: With dead ends: 3229 [2024-11-09 18:33:16,831 INFO L226 Difference]: Without dead ends: 2154 [2024-11-09 18:33:16,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,834 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 145 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-11-09 18:33:16,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2024-11-09 18:33:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2151. [2024-11-09 18:33:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2150 states have (on average 1.5055813953488373) internal successors, (3237), 2150 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3237 transitions. [2024-11-09 18:33:16,899 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3237 transitions. Word has length 25 [2024-11-09 18:33:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:16,900 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3237 transitions. [2024-11-09 18:33:16,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3237 transitions. [2024-11-09 18:33:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 18:33:16,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:16,902 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] [2024-11-09 18:33:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 18:33:16,903 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 548390034, now seen corresponding path program 1 times [2024-11-09 18:33:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443773921] [2024-11-09 18:33:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:16,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443773921] [2024-11-09 18:33:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443773921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:16,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:16,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:16,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164082840] [2024-11-09 18:33:16,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:16,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:16,938 INFO L87 Difference]: Start difference. First operand 2151 states and 3237 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:16,987 INFO L93 Difference]: Finished difference Result 2573 states and 3977 transitions. [2024-11-09 18:33:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:16,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-09 18:33:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:16,996 INFO L225 Difference]: With dead ends: 2573 [2024-11-09 18:33:16,996 INFO L226 Difference]: Without dead ends: 2570 [2024-11-09 18:33:16,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,001 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 40 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:17,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 179 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2024-11-09 18:33:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2151. [2024-11-09 18:33:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2150 states have (on average 1.4906976744186047) internal successors, (3205), 2150 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3205 transitions. [2024-11-09 18:33:17,105 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3205 transitions. Word has length 25 [2024-11-09 18:33:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,105 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3205 transitions. [2024-11-09 18:33:17,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3205 transitions. [2024-11-09 18:33:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 18:33:17,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,108 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] [2024-11-09 18:33:17,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 18:33:17,109 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -689476202, now seen corresponding path program 1 times [2024-11-09 18:33:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708846086] [2024-11-09 18:33:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:17,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708846086] [2024-11-09 18:33:17,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708846086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711786230] [2024-11-09 18:33:17,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,135 INFO L87 Difference]: Start difference. First operand 2151 states and 3205 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,200 INFO L93 Difference]: Finished difference Result 3821 states and 5801 transitions. [2024-11-09 18:33:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-09 18:33:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,213 INFO L225 Difference]: With dead ends: 3821 [2024-11-09 18:33:17,213 INFO L226 Difference]: Without dead ends: 3818 [2024-11-09 18:33:17,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,216 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:17,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2024-11-09 18:33:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3111. [2024-11-09 18:33:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 3110 states have (on average 1.452411575562701) internal successors, (4517), 3110 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 4517 transitions. [2024-11-09 18:33:17,305 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 4517 transitions. Word has length 26 [2024-11-09 18:33:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,305 INFO L471 AbstractCegarLoop]: Abstraction has 3111 states and 4517 transitions. [2024-11-09 18:33:17,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 4517 transitions. [2024-11-09 18:33:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 18:33:17,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,309 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] [2024-11-09 18:33:17,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 18:33:17,309 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash 818075607, now seen corresponding path program 1 times [2024-11-09 18:33:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530251970] [2024-11-09 18:33:17,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:17,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530251970] [2024-11-09 18:33:17,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530251970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348240473] [2024-11-09 18:33:17,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,333 INFO L87 Difference]: Start difference. First operand 3111 states and 4517 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,438 INFO L93 Difference]: Finished difference Result 7277 states and 10601 transitions. [2024-11-09 18:33:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-09 18:33:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,451 INFO L225 Difference]: With dead ends: 7277 [2024-11-09 18:33:17,451 INFO L226 Difference]: Without dead ends: 4202 [2024-11-09 18:33:17,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,455 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 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-11-09 18:33:17,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2024-11-09 18:33:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4199. [2024-11-09 18:33:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4199 states, 4198 states have (on average 1.4342544068604097) internal successors, (6021), 4198 states have internal predecessors, (6021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4199 states to 4199 states and 6021 transitions. [2024-11-09 18:33:17,574 INFO L78 Accepts]: Start accepts. Automaton has 4199 states and 6021 transitions. Word has length 26 [2024-11-09 18:33:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,574 INFO L471 AbstractCegarLoop]: Abstraction has 4199 states and 6021 transitions. [2024-11-09 18:33:17,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4199 states and 6021 transitions. [2024-11-09 18:33:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 18:33:17,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,578 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] [2024-11-09 18:33:17,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 18:33:17,579 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash 101903596, now seen corresponding path program 1 times [2024-11-09 18:33:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636235378] [2024-11-09 18:33:17,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:17,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636235378] [2024-11-09 18:33:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636235378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496099995] [2024-11-09 18:33:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,599 INFO L87 Difference]: Start difference. First operand 4199 states and 6021 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:17,692 INFO L93 Difference]: Finished difference Result 6349 states and 9097 transitions. [2024-11-09 18:33:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:17,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-09 18:33:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:17,707 INFO L225 Difference]: With dead ends: 6349 [2024-11-09 18:33:17,707 INFO L226 Difference]: Without dead ends: 4298 [2024-11-09 18:33:17,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,712 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:17,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:17,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2024-11-09 18:33:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4295. [2024-11-09 18:33:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 1.4170936190032604) internal successors, (6085), 4294 states have internal predecessors, (6085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 6085 transitions. [2024-11-09 18:33:17,866 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 6085 transitions. Word has length 27 [2024-11-09 18:33:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:17,867 INFO L471 AbstractCegarLoop]: Abstraction has 4295 states and 6085 transitions. [2024-11-09 18:33:17,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 6085 transitions. [2024-11-09 18:33:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 18:33:17,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:17,873 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] [2024-11-09 18:33:17,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 18:33:17,873 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:17,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash -408630581, now seen corresponding path program 1 times [2024-11-09 18:33:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789430601] [2024-11-09 18:33:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789430601] [2024-11-09 18:33:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789430601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886980220] [2024-11-09 18:33:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:17,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:17,895 INFO L87 Difference]: Start difference. First operand 4295 states and 6085 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,031 INFO L93 Difference]: Finished difference Result 7437 states and 10697 transitions. [2024-11-09 18:33:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-09 18:33:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,060 INFO L225 Difference]: With dead ends: 7437 [2024-11-09 18:33:18,060 INFO L226 Difference]: Without dead ends: 7434 [2024-11-09 18:33:18,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,067 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 34 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:18,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2024-11-09 18:33:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 6279. [2024-11-09 18:33:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6279 states, 6278 states have (on average 1.3770309015610067) internal successors, (8645), 6278 states have internal predecessors, (8645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 8645 transitions. [2024-11-09 18:33:18,233 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 8645 transitions. Word has length 27 [2024-11-09 18:33:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:18,233 INFO L471 AbstractCegarLoop]: Abstraction has 6279 states and 8645 transitions. [2024-11-09 18:33:18,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 8645 transitions. [2024-11-09 18:33:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 18:33:18,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:18,241 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] [2024-11-09 18:33:18,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 18:33:18,241 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:18,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1098921228, now seen corresponding path program 1 times [2024-11-09 18:33:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130836865] [2024-11-09 18:33:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130836865] [2024-11-09 18:33:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130836865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921522450] [2024-11-09 18:33:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,268 INFO L87 Difference]: Start difference. First operand 6279 states and 8645 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,424 INFO L93 Difference]: Finished difference Result 14477 states and 19913 transitions. [2024-11-09 18:33:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-09 18:33:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,439 INFO L225 Difference]: With dead ends: 14477 [2024-11-09 18:33:18,440 INFO L226 Difference]: Without dead ends: 8330 [2024-11-09 18:33:18,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,448 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 169 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-11-09 18:33:18,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 169 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2024-11-09 18:33:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 8327. [2024-11-09 18:33:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8327 states, 8326 states have (on average 1.3534710545279847) internal successors, (11269), 8326 states have internal predecessors, (11269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8327 states to 8327 states and 11269 transitions. [2024-11-09 18:33:18,707 INFO L78 Accepts]: Start accepts. Automaton has 8327 states and 11269 transitions. Word has length 27 [2024-11-09 18:33:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:18,708 INFO L471 AbstractCegarLoop]: Abstraction has 8327 states and 11269 transitions. [2024-11-09 18:33:18,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 11269 transitions. [2024-11-09 18:33:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 18:33:18,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:18,716 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] [2024-11-09 18:33:18,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 18:33:18,717 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:18,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:18,717 INFO L85 PathProgramCache]: Analyzing trace with hash 218176528, now seen corresponding path program 1 times [2024-11-09 18:33:18,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:18,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164853953] [2024-11-09 18:33:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:18,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164853953] [2024-11-09 18:33:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164853953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:18,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273399428] [2024-11-09 18:33:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:18,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,747 INFO L87 Difference]: Start difference. First operand 8327 states and 11269 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:18,859 INFO L93 Difference]: Finished difference Result 12493 states and 16841 transitions. [2024-11-09 18:33:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:18,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 18:33:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:18,875 INFO L225 Difference]: With dead ends: 12493 [2024-11-09 18:33:18,875 INFO L226 Difference]: Without dead ends: 8458 [2024-11-09 18:33:18,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:18,883 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:18,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2024-11-09 18:33:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 8455. [2024-11-09 18:33:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8455 states, 8454 states have (on average 1.332978471729359) internal successors, (11269), 8454 states have internal predecessors, (11269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 11269 transitions. [2024-11-09 18:33:19,195 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 11269 transitions. Word has length 28 [2024-11-09 18:33:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:19,195 INFO L471 AbstractCegarLoop]: Abstraction has 8455 states and 11269 transitions. [2024-11-09 18:33:19,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 11269 transitions. [2024-11-09 18:33:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 18:33:19,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:19,205 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] [2024-11-09 18:33:19,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 18:33:19,206 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash -292357649, now seen corresponding path program 1 times [2024-11-09 18:33:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869902337] [2024-11-09 18:33:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869902337] [2024-11-09 18:33:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869902337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:19,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238210671] [2024-11-09 18:33:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:19,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:19,233 INFO L87 Difference]: Start difference. First operand 8455 states and 11269 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:19,432 INFO L93 Difference]: Finished difference Result 14349 states and 19337 transitions. [2024-11-09 18:33:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 18:33:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:19,457 INFO L225 Difference]: With dead ends: 14349 [2024-11-09 18:33:19,457 INFO L226 Difference]: Without dead ends: 14346 [2024-11-09 18:33:19,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:19,462 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:19,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14346 states. [2024-11-09 18:33:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14346 to 12551. [2024-11-09 18:33:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12551 states, 12550 states have (on average 1.2956972111553784) internal successors, (16261), 12550 states have internal predecessors, (16261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12551 states to 12551 states and 16261 transitions. [2024-11-09 18:33:19,772 INFO L78 Accepts]: Start accepts. Automaton has 12551 states and 16261 transitions. Word has length 28 [2024-11-09 18:33:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:19,773 INFO L471 AbstractCegarLoop]: Abstraction has 12551 states and 16261 transitions. [2024-11-09 18:33:19,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12551 states and 16261 transitions. [2024-11-09 18:33:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 18:33:19,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:19,788 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] [2024-11-09 18:33:19,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 18:33:19,788 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:19,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:19,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1215194160, now seen corresponding path program 1 times [2024-11-09 18:33:19,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:19,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13050428] [2024-11-09 18:33:19,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:19,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13050428] [2024-11-09 18:33:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13050428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:19,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:19,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:19,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648234046] [2024-11-09 18:33:19,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:19,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:19,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:19,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:19,807 INFO L87 Difference]: Start difference. First operand 12551 states and 16261 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:20,075 INFO L93 Difference]: Finished difference Result 28685 states and 37001 transitions. [2024-11-09 18:33:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 18:33:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:20,103 INFO L225 Difference]: With dead ends: 28685 [2024-11-09 18:33:20,104 INFO L226 Difference]: Without dead ends: 16394 [2024-11-09 18:33:20,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:20,117 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 170 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-11-09 18:33:20,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16394 states. [2024-11-09 18:33:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16394 to 16391. [2024-11-09 18:33:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16391 states, 16390 states have (on average 1.2654667480170836) internal successors, (20741), 16390 states have internal predecessors, (20741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16391 states to 16391 states and 20741 transitions. [2024-11-09 18:33:20,584 INFO L78 Accepts]: Start accepts. Automaton has 16391 states and 20741 transitions. Word has length 28 [2024-11-09 18:33:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:20,584 INFO L471 AbstractCegarLoop]: Abstraction has 16391 states and 20741 transitions. [2024-11-09 18:33:20,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 16391 states and 20741 transitions. [2024-11-09 18:33:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 18:33:20,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:20,599 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] [2024-11-09 18:33:20,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 18:33:20,600 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:20,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash -472336603, now seen corresponding path program 1 times [2024-11-09 18:33:20,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:20,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32208289] [2024-11-09 18:33:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:20,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32208289] [2024-11-09 18:33:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32208289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:20,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:20,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722676465] [2024-11-09 18:33:20,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:20,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:20,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:20,626 INFO L87 Difference]: Start difference. First operand 16391 states and 20741 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:20,901 INFO L93 Difference]: Finished difference Result 24589 states and 30985 transitions. [2024-11-09 18:33:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:20,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-09 18:33:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:20,932 INFO L225 Difference]: With dead ends: 24589 [2024-11-09 18:33:20,932 INFO L226 Difference]: Without dead ends: 16650 [2024-11-09 18:33:20,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:20,946 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:20,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16650 states. [2024-11-09 18:33:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16650 to 16647. [2024-11-09 18:33:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16647 states, 16646 states have (on average 1.246005046257359) internal successors, (20741), 16646 states have internal predecessors, (20741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16647 states to 16647 states and 20741 transitions. [2024-11-09 18:33:21,352 INFO L78 Accepts]: Start accepts. Automaton has 16647 states and 20741 transitions. Word has length 29 [2024-11-09 18:33:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:21,352 INFO L471 AbstractCegarLoop]: Abstraction has 16647 states and 20741 transitions. [2024-11-09 18:33:21,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 16647 states and 20741 transitions. [2024-11-09 18:33:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 18:33:21,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:21,364 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] [2024-11-09 18:33:21,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 18:33:21,365 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:21,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash -982870780, now seen corresponding path program 1 times [2024-11-09 18:33:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:21,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901020864] [2024-11-09 18:33:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:21,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901020864] [2024-11-09 18:33:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901020864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150423288] [2024-11-09 18:33:21,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:21,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:21,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:21,390 INFO L87 Difference]: Start difference. First operand 16647 states and 20741 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:21,753 INFO L93 Difference]: Finished difference Result 27661 states and 34569 transitions. [2024-11-09 18:33:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:21,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-09 18:33:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:21,792 INFO L225 Difference]: With dead ends: 27661 [2024-11-09 18:33:21,792 INFO L226 Difference]: Without dead ends: 27658 [2024-11-09 18:33:21,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:21,799 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:21,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27658 states. [2024-11-09 18:33:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27658 to 25095. [2024-11-09 18:33:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25095 states, 25094 states have (on average 1.2141946281979756) internal successors, (30469), 25094 states have internal predecessors, (30469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25095 states to 25095 states and 30469 transitions. [2024-11-09 18:33:22,359 INFO L78 Accepts]: Start accepts. Automaton has 25095 states and 30469 transitions. Word has length 29 [2024-11-09 18:33:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:22,359 INFO L471 AbstractCegarLoop]: Abstraction has 25095 states and 30469 transitions. [2024-11-09 18:33:22,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 25095 states and 30469 transitions. [2024-11-09 18:33:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 18:33:22,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:22,385 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] [2024-11-09 18:33:22,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 18:33:22,386 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:22,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash 524681029, now seen corresponding path program 1 times [2024-11-09 18:33:22,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:22,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688173278] [2024-11-09 18:33:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:22,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-11-09 18:33:22,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:22,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688173278] [2024-11-09 18:33:22,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688173278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:22,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:22,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669025745] [2024-11-09 18:33:22,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:22,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:22,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:22,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:22,406 INFO L87 Difference]: Start difference. First operand 25095 states and 30469 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:22,916 INFO L93 Difference]: Finished difference Result 56845 states and 68361 transitions. [2024-11-09 18:33:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:22,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-09 18:33:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:22,962 INFO L225 Difference]: With dead ends: 56845 [2024-11-09 18:33:22,962 INFO L226 Difference]: Without dead ends: 32266 [2024-11-09 18:33:22,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:22,992 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 171 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-11-09 18:33:22,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32266 states. [2024-11-09 18:33:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32266 to 32263. [2024-11-09 18:33:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32263 states, 32262 states have (on average 1.174539706155849) internal successors, (37893), 32262 states have internal predecessors, (37893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32263 states to 32263 states and 37893 transitions. [2024-11-09 18:33:23,813 INFO L78 Accepts]: Start accepts. Automaton has 32263 states and 37893 transitions. Word has length 29 [2024-11-09 18:33:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:23,813 INFO L471 AbstractCegarLoop]: Abstraction has 32263 states and 37893 transitions. [2024-11-09 18:33:23,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 32263 states and 37893 transitions. [2024-11-09 18:33:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:33:23,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:23,835 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] [2024-11-09 18:33:23,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 18:33:23,835 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:23,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash -403413911, now seen corresponding path program 1 times [2024-11-09 18:33:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:23,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131468165] [2024-11-09 18:33:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:23,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131468165] [2024-11-09 18:33:23,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131468165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:23,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:23,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555965275] [2024-11-09 18:33:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:23,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:23,869 INFO L87 Difference]: Start difference. First operand 32263 states and 37893 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:24,425 INFO L93 Difference]: Finished difference Result 48397 states and 56585 transitions. [2024-11-09 18:33:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:24,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 18:33:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:24,467 INFO L225 Difference]: With dead ends: 48397 [2024-11-09 18:33:24,468 INFO L226 Difference]: Without dead ends: 32778 [2024-11-09 18:33:24,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:24,482 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:24,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2024-11-09 18:33:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 32775. [2024-11-09 18:33:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 32774 states have (on average 1.1561908830170258) internal successors, (37893), 32774 states have internal predecessors, (37893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 37893 transitions. [2024-11-09 18:33:25,095 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 37893 transitions. Word has length 30 [2024-11-09 18:33:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:25,095 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 37893 transitions. [2024-11-09 18:33:25,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 37893 transitions. [2024-11-09 18:33:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:33:25,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:25,113 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] [2024-11-09 18:33:25,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 18:33:25,113 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:25,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:25,114 INFO L85 PathProgramCache]: Analyzing trace with hash -913948088, now seen corresponding path program 1 times [2024-11-09 18:33:25,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:25,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650511032] [2024-11-09 18:33:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:25,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650511032] [2024-11-09 18:33:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650511032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048702976] [2024-11-09 18:33:25,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:25,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:25,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:25,133 INFO L87 Difference]: Start difference. First operand 32775 states and 37893 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:26,038 INFO L93 Difference]: Finished difference Result 53258 states and 60935 transitions. [2024-11-09 18:33:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:26,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 18:33:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:26,114 INFO L225 Difference]: With dead ends: 53258 [2024-11-09 18:33:26,114 INFO L226 Difference]: Without dead ends: 53255 [2024-11-09 18:33:26,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:26,128 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:26,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53255 states. [2024-11-09 18:33:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53255 to 50183. [2024-11-09 18:33:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50183 states, 50182 states have (on average 1.132617273125822) internal successors, (56837), 50182 states have internal predecessors, (56837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50183 states to 50183 states and 56837 transitions. [2024-11-09 18:33:26,970 INFO L78 Accepts]: Start accepts. Automaton has 50183 states and 56837 transitions. Word has length 30 [2024-11-09 18:33:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:26,971 INFO L471 AbstractCegarLoop]: Abstraction has 50183 states and 56837 transitions. [2024-11-09 18:33:26,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 50183 states and 56837 transitions. [2024-11-09 18:33:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:33:27,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:27,029 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] [2024-11-09 18:33:27,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 18:33:27,030 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 593603721, now seen corresponding path program 1 times [2024-11-09 18:33:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932928845] [2024-11-09 18:33:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:33:27,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:27,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932928845] [2024-11-09 18:33:27,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932928845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:27,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895011041] [2024-11-09 18:33:27,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:27,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:27,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:27,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:27,052 INFO L87 Difference]: Start difference. First operand 50183 states and 56837 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:28,139 INFO L93 Difference]: Finished difference Result 112647 states and 125445 transitions. [2024-11-09 18:33:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:28,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 18:33:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:28,143 INFO L225 Difference]: With dead ends: 112647 [2024-11-09 18:33:28,143 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:33:28,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:28,196 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 43 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 168 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-11-09 18:33:28,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:33:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:33:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:33:28,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-11-09 18:33:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:28,201 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:33:28,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:33:28,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:33:28,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:33:28,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 18:33:28,207 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-09 18:33:28,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:33:28,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:33:28,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:33:28 BoogieIcfgContainer [2024-11-09 18:33:28,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:33:28,231 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:33:28,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:33:28,232 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:33:28,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:14" (3/4) ... [2024-11-09 18:33:28,234 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:33:28,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 18:33:28,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 18:33:28,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:33:28,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:33:28,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:33:28,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:33:28,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:33:28,623 INFO L158 Benchmark]: Toolchain (without parser) took 14658.95ms. Allocated memory was 148.9MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 94.4MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-09 18:33:28,623 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 148.9MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:33:28,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.62ms. Allocated memory is still 148.9MB. Free memory was 94.0MB in the beginning and 80.8MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:33:28,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.70ms. Allocated memory is still 148.9MB. Free memory was 80.8MB in the beginning and 78.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:33:28,623 INFO L158 Benchmark]: Boogie Preprocessor took 50.35ms. Allocated memory is still 148.9MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:33:28,624 INFO L158 Benchmark]: IcfgBuilder took 449.65ms. Allocated memory is still 148.9MB. Free memory was 77.2MB in the beginning and 61.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 18:33:28,624 INFO L158 Benchmark]: TraceAbstraction took 13425.75ms. Allocated memory was 148.9MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 60.8MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-09 18:33:28,624 INFO L158 Benchmark]: Witness Printer took 390.70ms. Allocated memory is still 5.4GB. Free memory was 3.5GB in the beginning and 4.8GB in the end (delta: -1.3GB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2024-11-09 18:33:28,628 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82ms. Allocated memory is still 148.9MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.62ms. Allocated memory is still 148.9MB. Free memory was 94.0MB in the beginning and 80.8MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.70ms. Allocated memory is still 148.9MB. Free memory was 80.8MB in the beginning and 78.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.35ms. Allocated memory is still 148.9MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 449.65ms. Allocated memory is still 148.9MB. Free memory was 77.2MB in the beginning and 61.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13425.75ms. Allocated memory was 148.9MB in the beginning and 5.4GB in the end (delta: 5.2GB). Free memory was 60.8MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 390.70ms. Allocated memory is still 5.4GB. Free memory was 3.5GB in the beginning and 4.8GB in the end (delta: -1.3GB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1462 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1462 mSDsluCounter, 4826 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1930 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2896 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50183occurred in iteration=30, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 10300 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 779 NumberOfCodeBlocks, 779 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 748 ConstructedInterpolants, 0 QuantifiedInterpolants, 1551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:33:28,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE