./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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.dk.eval-mul-div-a046e57-m [2024-10-12 15:12:10,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:12:10,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:12:10,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:12:10,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:12:10,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:12:10,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:12:10,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:12:10,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:12:10,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:12:10,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:12:10,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:12:10,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:12:10,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:12:10,197 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:12:10,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:12:10,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:12:10,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:12:10,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:12:10,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:12:10,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:12:10,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:12:10,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:12:10,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:12:10,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:12:10,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:12:10,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:12:10,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:12:10,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:12:10,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:12:10,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:12:10,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:12:10,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:12:10,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:12:10,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:12:10,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:12:10,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:12:10,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:12:10,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:12:10,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:12:10,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:12:10,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:12:10,226 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-10-12 15:12:10,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:12:10,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:12:10,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:12:10,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:12:10,519 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:12:10,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-10-12 15:12:12,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:12:12,192 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:12:12,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-10-12 15:12:12,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2baa8621/c1842f020370483eb6871eeda317b0d6/FLAG3198dd3b5 [2024-10-12 15:12:12,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2baa8621/c1842f020370483eb6871eeda317b0d6 [2024-10-12 15:12:12,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:12:12,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:12:12,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:12:12,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:12:12,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:12:12,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2013033f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12, skipping insertion in model container [2024-10-12 15:12:12,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:12:12,413 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2024-10-12 15:12:12,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:12:12,430 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:12:12,461 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2024-10-12 15:12:12,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:12:12,487 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:12:12,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12 WrapperNode [2024-10-12 15:12:12,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:12:12,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:12:12,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:12:12,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:12:12,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,526 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2024-10-12 15:12:12,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:12:12,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:12:12,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:12:12,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:12:12,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,563 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:12:12,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:12:12,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:12:12,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:12:12,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:12:12,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (1/1) ... [2024-10-12 15:12:12,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:12:12,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:12:12,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:12:12,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:12:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:12:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:12:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:12:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:12:12,750 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:12:12,752 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:12:12,969 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-12 15:12:12,969 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:12:13,007 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:12:13,007 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:12:13,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:12:13 BoogieIcfgContainer [2024-10-12 15:12:13,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:12:13,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:12:13,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:12:13,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:12:13,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:12:12" (1/3) ... [2024-10-12 15:12:13,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b4d333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:12:13, skipping insertion in model container [2024-10-12 15:12:13,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:12" (2/3) ... [2024-10-12 15:12:13,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b4d333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:12:13, skipping insertion in model container [2024-10-12 15:12:13,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:12:13" (3/3) ... [2024-10-12 15:12:13,017 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2024-10-12 15:12:13,033 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:12:13,033 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:12:13,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:12:13,112 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;@59ef5ba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:12:13,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:12:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 40 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 15:12:13,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:13,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:13,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash 798475764, now seen corresponding path program 1 times [2024-10-12 15:12:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:13,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537474465] [2024-10-12 15:12:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:13,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:13,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537474465] [2024-10-12 15:12:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537474465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:13,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:13,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736362980] [2024-10-12 15:12:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:13,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:13,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,385 INFO L87 Difference]: Start difference. First operand has 41 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 40 states have internal predecessors, (76), 0 states have call successors, (0), 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 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:13,436 INFO L93 Difference]: Finished difference Result 84 states and 153 transitions. [2024-10-12 15:12:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:13,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-12 15:12:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:13,447 INFO L225 Difference]: With dead ends: 84 [2024-10-12 15:12:13,448 INFO L226 Difference]: Without dead ends: 74 [2024-10-12 15:12:13,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,454 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:13,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 142 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-12 15:12:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2024-10-12 15:12:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2024-10-12 15:12:13,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2024-10-12 15:12:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:13,494 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2024-10-12 15:12:13,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2024-10-12 15:12:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 15:12:13,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:13,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:13,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:12:13,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:13,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -212641486, now seen corresponding path program 1 times [2024-10-12 15:12:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:13,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427160444] [2024-10-12 15:12:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427160444] [2024-10-12 15:12:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427160444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457389555] [2024-10-12 15:12:13,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:13,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:13,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,614 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:13,640 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2024-10-12 15:12:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-12 15:12:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:13,642 INFO L225 Difference]: With dead ends: 123 [2024-10-12 15:12:13,643 INFO L226 Difference]: Without dead ends: 74 [2024-10-12 15:12:13,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,644 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 53 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:13,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 154 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-12 15:12:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-10-12 15:12:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 71 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2024-10-12 15:12:13,654 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2024-10-12 15:12:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:13,654 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2024-10-12 15:12:13,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2024-10-12 15:12:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 15:12:13,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:13,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:12:13,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:13,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1016842068, now seen corresponding path program 1 times [2024-10-12 15:12:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585040099] [2024-10-12 15:12:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:13,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585040099] [2024-10-12 15:12:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585040099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:13,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:13,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033041222] [2024-10-12 15:12:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:13,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:13,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:13,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:13,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,712 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:13,736 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2024-10-12 15:12:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:13,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-12 15:12:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:13,737 INFO L225 Difference]: With dead ends: 113 [2024-10-12 15:12:13,737 INFO L226 Difference]: Without dead ends: 77 [2024-10-12 15:12:13,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,739 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 55 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:13,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-12 15:12:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-10-12 15:12:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.8243243243243243) internal successors, (135), 74 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2024-10-12 15:12:13,752 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2024-10-12 15:12:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:13,753 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2024-10-12 15:12:13,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2024-10-12 15:12:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 15:12:13,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:13,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:13,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:12:13,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:13,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1998261550, now seen corresponding path program 1 times [2024-10-12 15:12:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126829650] [2024-10-12 15:12:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126829650] [2024-10-12 15:12:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126829650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052855684] [2024-10-12 15:12:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,822 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:13,854 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2024-10-12 15:12:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-12 15:12:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:13,856 INFO L225 Difference]: With dead ends: 144 [2024-10-12 15:12:13,856 INFO L226 Difference]: Without dead ends: 142 [2024-10-12 15:12:13,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,858 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:13,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-12 15:12:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2024-10-12 15:12:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8181818181818181) internal successors, (180), 99 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2024-10-12 15:12:13,872 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2024-10-12 15:12:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:13,873 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2024-10-12 15:12:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2024-10-12 15:12:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 15:12:13,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:13,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:13,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:12:13,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:13,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash 987144300, now seen corresponding path program 1 times [2024-10-12 15:12:13,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:13,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014115918] [2024-10-12 15:12:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014115918] [2024-10-12 15:12:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014115918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:13,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:13,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:13,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437703810] [2024-10-12 15:12:13,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:13,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:13,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:13,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:13,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,928 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:13,957 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2024-10-12 15:12:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-12 15:12:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:13,959 INFO L225 Difference]: With dead ends: 240 [2024-10-12 15:12:13,959 INFO L226 Difference]: Without dead ends: 144 [2024-10-12 15:12:13,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:13,961 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 52 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:13,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 155 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-12 15:12:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-10-12 15:12:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.801418439716312) internal successors, (254), 141 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2024-10-12 15:12:13,974 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2024-10-12 15:12:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:13,974 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2024-10-12 15:12:13,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2024-10-12 15:12:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 15:12:13,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:13,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:13,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:12:13,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:13,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1816779271, now seen corresponding path program 1 times [2024-10-12 15:12:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35580311] [2024-10-12 15:12:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:13,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35580311] [2024-10-12 15:12:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35580311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702409088] [2024-10-12 15:12:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,017 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,031 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2024-10-12 15:12:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 15:12:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,033 INFO L225 Difference]: With dead ends: 215 [2024-10-12 15:12:14,033 INFO L226 Difference]: Without dead ends: 146 [2024-10-12 15:12:14,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,035 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 54 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 169 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-12 15:12:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-10-12 15:12:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.7762237762237763) internal successors, (254), 143 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2024-10-12 15:12:14,055 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2024-10-12 15:12:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,055 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2024-10-12 15:12:14,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2024-10-12 15:12:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 15:12:14,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:14,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:12:14,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash 536915593, now seen corresponding path program 1 times [2024-10-12 15:12:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605216060] [2024-10-12 15:12:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605216060] [2024-10-12 15:12:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605216060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003248734] [2024-10-12 15:12:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,098 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,121 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2024-10-12 15:12:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 15:12:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,124 INFO L225 Difference]: With dead ends: 416 [2024-10-12 15:12:14,124 INFO L226 Difference]: Without dead ends: 278 [2024-10-12 15:12:14,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,128 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 136 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-12 15:12:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2024-10-12 15:12:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.7527272727272727) internal successors, (482), 275 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2024-10-12 15:12:14,149 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2024-10-12 15:12:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,149 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2024-10-12 15:12:14,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2024-10-12 15:12:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 15:12:14,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:14,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:12:14,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1548032843, now seen corresponding path program 1 times [2024-10-12 15:12:14,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567472114] [2024-10-12 15:12:14,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567472114] [2024-10-12 15:12:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567472114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107630746] [2024-10-12 15:12:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,184 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,198 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2024-10-12 15:12:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 15:12:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,200 INFO L225 Difference]: With dead ends: 352 [2024-10-12 15:12:14,200 INFO L226 Difference]: Without dead ends: 350 [2024-10-12 15:12:14,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,201 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 47 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 185 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-10-12 15:12:14,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-12 15:12:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2024-10-12 15:12:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.7381818181818183) internal successors, (478), 275 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2024-10-12 15:12:14,212 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2024-10-12 15:12:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,213 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2024-10-12 15:12:14,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2024-10-12 15:12:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 15:12:14,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,215 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-10-12 15:12:14,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:12:14,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -535272095, now seen corresponding path program 1 times [2024-10-12 15:12:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901251231] [2024-10-12 15:12:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901251231] [2024-10-12 15:12:14,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901251231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383879487] [2024-10-12 15:12:14,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,249 INFO L87 Difference]: Start difference. First operand 276 states and 478 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-10-12 15:12:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,266 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2024-10-12 15:12:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,267 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-10-12 15:12:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,269 INFO L225 Difference]: With dead ends: 516 [2024-10-12 15:12:14,269 INFO L226 Difference]: Without dead ends: 514 [2024-10-12 15:12:14,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,271 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 44 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-12 15:12:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2024-10-12 15:12:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.7075718015665797) internal successors, (654), 383 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2024-10-12 15:12:14,304 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2024-10-12 15:12:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,305 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2024-10-12 15:12:14,305 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-10-12 15:12:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2024-10-12 15:12:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 15:12:14,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,307 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-10-12 15:12:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:12:14,307 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1546389345, now seen corresponding path program 1 times [2024-10-12 15:12:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351348046] [2024-10-12 15:12:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351348046] [2024-10-12 15:12:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351348046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275333212] [2024-10-12 15:12:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,354 INFO L87 Difference]: Start difference. First operand 384 states and 654 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-10-12 15:12:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,382 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2024-10-12 15:12:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,383 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-10-12 15:12:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,386 INFO L225 Difference]: With dead ends: 916 [2024-10-12 15:12:14,386 INFO L226 Difference]: Without dead ends: 538 [2024-10-12 15:12:14,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,388 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 157 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-12 15:12:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2024-10-12 15:12:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.6934579439252337) internal successors, (906), 535 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2024-10-12 15:12:14,408 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2024-10-12 15:12:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,408 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2024-10-12 15:12:14,408 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-10-12 15:12:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2024-10-12 15:12:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:12:14,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,409 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-10-12 15:12:14,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:12:14,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash 586648286, now seen corresponding path program 1 times [2024-10-12 15:12:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261117571] [2024-10-12 15:12:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261117571] [2024-10-12 15:12:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261117571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821313770] [2024-10-12 15:12:14,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,454 INFO L87 Difference]: Start difference. First operand 536 states and 906 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-10-12 15:12:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,479 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2024-10-12 15:12:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,479 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-10-12 15:12:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,481 INFO L225 Difference]: With dead ends: 812 [2024-10-12 15:12:14,481 INFO L226 Difference]: Without dead ends: 550 [2024-10-12 15:12:14,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,483 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 52 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-12 15:12:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2024-10-12 15:12:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.6709323583180986) internal successors, (914), 547 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2024-10-12 15:12:14,501 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2024-10-12 15:12:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,503 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2024-10-12 15:12:14,503 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-10-12 15:12:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2024-10-12 15:12:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:12:14,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,505 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-10-12 15:12:14,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:12:14,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash -693215392, now seen corresponding path program 1 times [2024-10-12 15:12:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234684200] [2024-10-12 15:12:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234684200] [2024-10-12 15:12:14,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234684200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689910346] [2024-10-12 15:12:14,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,533 INFO L87 Difference]: Start difference. First operand 548 states and 914 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-10-12 15:12:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,562 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2024-10-12 15:12:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,562 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-10-12 15:12:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,565 INFO L225 Difference]: With dead ends: 1000 [2024-10-12 15:12:14,567 INFO L226 Difference]: Without dead ends: 998 [2024-10-12 15:12:14,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,569 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 41 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-10-12 15:12:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2024-10-12 15:12:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.6316472114137484) internal successors, (1258), 771 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2024-10-12 15:12:14,590 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2024-10-12 15:12:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,591 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2024-10-12 15:12:14,591 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-10-12 15:12:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2024-10-12 15:12:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:12:14,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,593 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-10-12 15:12:14,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:12:14,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1704332642, now seen corresponding path program 1 times [2024-10-12 15:12:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301463196] [2024-10-12 15:12:14,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301463196] [2024-10-12 15:12:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301463196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922255361] [2024-10-12 15:12:14,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,627 INFO L87 Difference]: Start difference. First operand 772 states and 1258 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-10-12 15:12:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,658 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2024-10-12 15:12:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,659 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-10-12 15:12:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,663 INFO L225 Difference]: With dead ends: 1816 [2024-10-12 15:12:14,663 INFO L226 Difference]: Without dead ends: 1062 [2024-10-12 15:12:14,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,665 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 158 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2024-10-12 15:12:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2024-10-12 15:12:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 1.6185080264400378) internal successors, (1714), 1059 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2024-10-12 15:12:14,697 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2024-10-12 15:12:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,697 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2024-10-12 15:12:14,698 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-10-12 15:12:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2024-10-12 15:12:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 15:12:14,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,715 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-10-12 15:12:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:12:14,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash -14626284, now seen corresponding path program 1 times [2024-10-12 15:12:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708041213] [2024-10-12 15:12:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708041213] [2024-10-12 15:12:14,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708041213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202711064] [2024-10-12 15:12:14,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,757 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 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-10-12 15:12:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,790 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2024-10-12 15:12:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,791 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-10-12 15:12:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,796 INFO L225 Difference]: With dead ends: 1592 [2024-10-12 15:12:14,796 INFO L226 Difference]: Without dead ends: 1078 [2024-10-12 15:12:14,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,798 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-10-12 15:12:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2024-10-12 15:12:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1075 states have (on average 1.5944186046511628) internal successors, (1714), 1075 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2024-10-12 15:12:14,836 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2024-10-12 15:12:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,837 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2024-10-12 15:12:14,837 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-10-12 15:12:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2024-10-12 15:12:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 15:12:14,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,838 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-10-12 15:12:14,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:12:14,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1294489962, now seen corresponding path program 1 times [2024-10-12 15:12:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453474674] [2024-10-12 15:12:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453474674] [2024-10-12 15:12:14,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453474674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:14,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:14,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520923368] [2024-10-12 15:12:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:14,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:14,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,872 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 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-10-12 15:12:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:14,924 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2024-10-12 15:12:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:14,925 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-10-12 15:12:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:14,931 INFO L225 Difference]: With dead ends: 1928 [2024-10-12 15:12:14,931 INFO L226 Difference]: Without dead ends: 1926 [2024-10-12 15:12:14,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:14,932 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:14,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 126 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2024-10-12 15:12:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2024-10-12 15:12:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 1.5503573749187785) internal successors, (2386), 1539 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2024-10-12 15:12:14,974 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2024-10-12 15:12:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:14,975 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2024-10-12 15:12:14,975 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-10-12 15:12:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2024-10-12 15:12:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 15:12:14,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:14,977 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-10-12 15:12:14,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:12:14,977 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:14,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1989360084, now seen corresponding path program 1 times [2024-10-12 15:12:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:14,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561112470] [2024-10-12 15:12:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:14,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:15,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561112470] [2024-10-12 15:12:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561112470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:15,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:15,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103912503] [2024-10-12 15:12:15,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:15,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:15,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,007 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 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-10-12 15:12:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:15,055 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2024-10-12 15:12:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:15,056 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-10-12 15:12:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:15,062 INFO L225 Difference]: With dead ends: 3592 [2024-10-12 15:12:15,063 INFO L226 Difference]: Without dead ends: 2086 [2024-10-12 15:12:15,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,066 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:15,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 159 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2024-10-12 15:12:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2024-10-12 15:12:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2083 states have (on average 1.5372059529524724) internal successors, (3202), 2083 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2024-10-12 15:12:15,164 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2024-10-12 15:12:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:15,164 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2024-10-12 15:12:15,164 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-10-12 15:12:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2024-10-12 15:12:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:12:15,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:15,166 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-10-12 15:12:15,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:12:15,167 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:15,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:15,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1474268429, now seen corresponding path program 1 times [2024-10-12 15:12:15,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:15,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643212515] [2024-10-12 15:12:15,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:15,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643212515] [2024-10-12 15:12:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643212515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:15,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383962563] [2024-10-12 15:12:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:15,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:15,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,193 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 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-10-12 15:12:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:15,243 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2024-10-12 15:12:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:15,243 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-10-12 15:12:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:15,250 INFO L225 Difference]: With dead ends: 3128 [2024-10-12 15:12:15,250 INFO L226 Difference]: Without dead ends: 2118 [2024-10-12 15:12:15,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,254 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:15,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:15,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2024-10-12 15:12:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2024-10-12 15:12:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2115 states have (on average 1.5139479905437352) internal successors, (3202), 2115 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2024-10-12 15:12:15,315 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2024-10-12 15:12:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:15,315 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2024-10-12 15:12:15,315 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-10-12 15:12:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2024-10-12 15:12:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:12:15,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:15,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:15,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 15:12:15,318 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:15,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1540835189, now seen corresponding path program 1 times [2024-10-12 15:12:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:15,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067892579] [2024-10-12 15:12:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:15,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:15,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067892579] [2024-10-12 15:12:15,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067892579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:15,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:15,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548396942] [2024-10-12 15:12:15,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:15,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,345 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 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-10-12 15:12:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:15,409 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2024-10-12 15:12:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:15,409 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-10-12 15:12:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:15,420 INFO L225 Difference]: With dead ends: 3720 [2024-10-12 15:12:15,420 INFO L226 Difference]: Without dead ends: 3718 [2024-10-12 15:12:15,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,424 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:15,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 124 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2024-10-12 15:12:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2024-10-12 15:12:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 3075 states have (on average 1.4679674796747968) internal successors, (4514), 3075 states have internal predecessors, (4514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2024-10-12 15:12:15,530 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2024-10-12 15:12:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:15,530 INFO L471 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2024-10-12 15:12:15,531 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-10-12 15:12:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2024-10-12 15:12:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:12:15,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:15,535 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-10-12 15:12:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 15:12:15,535 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:15,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash 529717939, now seen corresponding path program 1 times [2024-10-12 15:12:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92210912] [2024-10-12 15:12:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:15,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92210912] [2024-10-12 15:12:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92210912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:15,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:15,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108868210] [2024-10-12 15:12:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:15,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:15,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,564 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 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-10-12 15:12:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:15,662 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2024-10-12 15:12:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:15,663 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-10-12 15:12:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:15,676 INFO L225 Difference]: With dead ends: 7112 [2024-10-12 15:12:15,676 INFO L226 Difference]: Without dead ends: 4102 [2024-10-12 15:12:15,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,681 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:15,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 160 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2024-10-12 15:12:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2024-10-12 15:12:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4100 states, 4099 states have (on average 1.4525494022932424) internal successors, (5954), 4099 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2024-10-12 15:12:15,841 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2024-10-12 15:12:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:15,841 INFO L471 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2024-10-12 15:12:15,841 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-10-12 15:12:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2024-10-12 15:12:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 15:12:15,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:15,845 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-10-12 15:12:15,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 15:12:15,846 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:15,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash 521465673, now seen corresponding path program 1 times [2024-10-12 15:12:15,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:15,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980978652] [2024-10-12 15:12:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980978652] [2024-10-12 15:12:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980978652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:15,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:15,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251687239] [2024-10-12 15:12:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:15,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,875 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 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-10-12 15:12:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:15,966 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2024-10-12 15:12:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:15,967 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-10-12 15:12:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:15,991 INFO L225 Difference]: With dead ends: 6152 [2024-10-12 15:12:15,991 INFO L226 Difference]: Without dead ends: 4166 [2024-10-12 15:12:15,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:15,996 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:15,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2024-10-12 15:12:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2024-10-12 15:12:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 4163 states have (on average 1.430218592361278) internal successors, (5954), 4163 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2024-10-12 15:12:16,199 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2024-10-12 15:12:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2024-10-12 15:12:16,199 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-10-12 15:12:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2024-10-12 15:12:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 15:12:16,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:16,207 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-10-12 15:12:16,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:12:16,207 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -758398005, now seen corresponding path program 1 times [2024-10-12 15:12:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635081223] [2024-10-12 15:12:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:16,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:16,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635081223] [2024-10-12 15:12:16,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635081223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:16,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:16,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:16,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990570541] [2024-10-12 15:12:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:16,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:16,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:16,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:16,242 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 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-10-12 15:12:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:16,408 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2024-10-12 15:12:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:16,408 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-10-12 15:12:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:16,432 INFO L225 Difference]: With dead ends: 7176 [2024-10-12 15:12:16,432 INFO L226 Difference]: Without dead ends: 7174 [2024-10-12 15:12:16,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:16,436 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:16,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 122 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2024-10-12 15:12:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2024-10-12 15:12:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 6147 states have (on average 1.3850658857979503) internal successors, (8514), 6147 states have internal predecessors, (8514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2024-10-12 15:12:16,650 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2024-10-12 15:12:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:16,651 INFO L471 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2024-10-12 15:12:16,651 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-10-12 15:12:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2024-10-12 15:12:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 15:12:16,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:16,657 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-10-12 15:12:16,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 15:12:16,657 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:16,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1769515255, now seen corresponding path program 1 times [2024-10-12 15:12:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23036611] [2024-10-12 15:12:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:16,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23036611] [2024-10-12 15:12:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23036611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:16,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883145432] [2024-10-12 15:12:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:16,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:16,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:16,679 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 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-10-12 15:12:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:16,800 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2024-10-12 15:12:16,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:16,800 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-10-12 15:12:16,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:16,815 INFO L225 Difference]: With dead ends: 14088 [2024-10-12 15:12:16,816 INFO L226 Difference]: Without dead ends: 8070 [2024-10-12 15:12:16,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:16,824 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:16,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2024-10-12 15:12:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2024-10-12 15:12:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8068 states, 8067 states have (on average 1.36481963555225) internal successors, (11010), 8067 states have internal predecessors, (11010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2024-10-12 15:12:17,077 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2024-10-12 15:12:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,077 INFO L471 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2024-10-12 15:12:17,077 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-10-12 15:12:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2024-10-12 15:12:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 15:12:17,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,084 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-10-12 15:12:17,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 15:12:17,085 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2035286264, now seen corresponding path program 1 times [2024-10-12 15:12:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301296725] [2024-10-12 15:12:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301296725] [2024-10-12 15:12:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301296725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679094590] [2024-10-12 15:12:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,105 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 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-10-12 15:12:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,245 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2024-10-12 15:12:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,245 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-10-12 15:12:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,258 INFO L225 Difference]: With dead ends: 12104 [2024-10-12 15:12:17,258 INFO L226 Difference]: Without dead ends: 8198 [2024-10-12 15:12:17,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,263 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2024-10-12 15:12:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2024-10-12 15:12:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8196 states, 8195 states have (on average 1.3435021354484442) internal successors, (11010), 8195 states have internal predecessors, (11010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2024-10-12 15:12:17,449 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2024-10-12 15:12:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,450 INFO L471 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2024-10-12 15:12:17,450 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-10-12 15:12:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2024-10-12 15:12:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 15:12:17,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,457 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-10-12 15:12:17,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 15:12:17,458 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash 979817354, now seen corresponding path program 1 times [2024-10-12 15:12:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908060158] [2024-10-12 15:12:17,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908060158] [2024-10-12 15:12:17,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908060158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046146773] [2024-10-12 15:12:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,480 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 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-10-12 15:12:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,773 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2024-10-12 15:12:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,774 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-10-12 15:12:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,801 INFO L225 Difference]: With dead ends: 13832 [2024-10-12 15:12:17,801 INFO L226 Difference]: Without dead ends: 13830 [2024-10-12 15:12:17,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,809 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2024-10-12 15:12:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2024-10-12 15:12:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12292 states, 12291 states have (on average 1.3019282401757384) internal successors, (16002), 12291 states have internal predecessors, (16002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2024-10-12 15:12:18,140 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2024-10-12 15:12:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,140 INFO L471 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2024-10-12 15:12:18,140 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-10-12 15:12:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2024-10-12 15:12:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 15:12:18,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:18,154 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-10-12 15:12:18,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 15:12:18,154 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -31299896, now seen corresponding path program 1 times [2024-10-12 15:12:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899489069] [2024-10-12 15:12:18,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899489069] [2024-10-12 15:12:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899489069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950286262] [2024-10-12 15:12:18,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,177 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 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-10-12 15:12:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:18,378 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2024-10-12 15:12:18,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:18,379 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-10-12 15:12:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:18,407 INFO L225 Difference]: With dead ends: 27912 [2024-10-12 15:12:18,407 INFO L226 Difference]: Without dead ends: 15878 [2024-10-12 15:12:18,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,425 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:18,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 162 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2024-10-12 15:12:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2024-10-12 15:12:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15876 states, 15875 states have (on average 1.2740787401574802) internal successors, (20226), 15875 states have internal predecessors, (20226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2024-10-12 15:12:18,805 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2024-10-12 15:12:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,805 INFO L471 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2024-10-12 15:12:18,806 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-10-12 15:12:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2024-10-12 15:12:18,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 15:12:18,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:18,819 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-10-12 15:12:18,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 15:12:18,820 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash 309782654, now seen corresponding path program 1 times [2024-10-12 15:12:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440324187] [2024-10-12 15:12:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440324187] [2024-10-12 15:12:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440324187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843915350] [2024-10-12 15:12:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,839 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 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-10-12 15:12:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:19,087 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2024-10-12 15:12:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:19,088 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-10-12 15:12:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:19,118 INFO L225 Difference]: With dead ends: 23816 [2024-10-12 15:12:19,118 INFO L226 Difference]: Without dead ends: 16134 [2024-10-12 15:12:19,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:19,129 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:19,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 141 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2024-10-12 15:12:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2024-10-12 15:12:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16132 states, 16131 states have (on average 1.2538590291984377) internal successors, (20226), 16131 states have internal predecessors, (20226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2024-10-12 15:12:19,598 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2024-10-12 15:12:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:19,598 INFO L471 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2024-10-12 15:12:19,598 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-10-12 15:12:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2024-10-12 15:12:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 15:12:19,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:19,616 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-10-12 15:12:19,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 15:12:19,617 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:19,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash -970081024, now seen corresponding path program 1 times [2024-10-12 15:12:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:19,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906165795] [2024-10-12 15:12:19,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:19,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906165795] [2024-10-12 15:12:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906165795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:19,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505161175] [2024-10-12 15:12:19,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:19,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:19,641 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 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-10-12 15:12:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:20,115 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2024-10-12 15:12:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:20,116 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-10-12 15:12:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:20,171 INFO L225 Difference]: With dead ends: 26632 [2024-10-12 15:12:20,171 INFO L226 Difference]: Without dead ends: 26630 [2024-10-12 15:12:20,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:20,183 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 26 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:20,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2024-10-12 15:12:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2024-10-12 15:12:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24580 states, 24579 states have (on average 1.2186826152406527) internal successors, (29954), 24579 states have internal predecessors, (29954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2024-10-12 15:12:20,731 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2024-10-12 15:12:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:20,732 INFO L471 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2024-10-12 15:12:20,732 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-10-12 15:12:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2024-10-12 15:12:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 15:12:20,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:20,777 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-10-12 15:12:20,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 15:12:20,777 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1981198274, now seen corresponding path program 1 times [2024-10-12 15:12:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943286019] [2024-10-12 15:12:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943286019] [2024-10-12 15:12:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943286019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868203118] [2024-10-12 15:12:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:20,804 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 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-10-12 15:12:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:21,291 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2024-10-12 15:12:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:21,291 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-10-12 15:12:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:21,341 INFO L225 Difference]: With dead ends: 55304 [2024-10-12 15:12:21,342 INFO L226 Difference]: Without dead ends: 31238 [2024-10-12 15:12:21,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:21,366 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:21,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 163 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2024-10-12 15:12:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2024-10-12 15:12:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31236 states, 31235 states have (on average 1.180278533696174) internal successors, (36866), 31235 states have internal predecessors, (36866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2024-10-12 15:12:21,998 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2024-10-12 15:12:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:21,998 INFO L471 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2024-10-12 15:12:21,999 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-10-12 15:12:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2024-10-12 15:12:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 15:12:22,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:22,016 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-10-12 15:12:22,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 15:12:22,016 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:22,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash -7524579, now seen corresponding path program 1 times [2024-10-12 15:12:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:22,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863645600] [2024-10-12 15:12:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:22,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863645600] [2024-10-12 15:12:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863645600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:22,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258138538] [2024-10-12 15:12:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:22,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:22,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:22,035 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 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-10-12 15:12:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:22,464 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2024-10-12 15:12:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:22,465 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-10-12 15:12:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:22,522 INFO L225 Difference]: With dead ends: 46856 [2024-10-12 15:12:22,523 INFO L226 Difference]: Without dead ends: 31750 [2024-10-12 15:12:22,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:22,539 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:22,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2024-10-12 15:12:23,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2024-10-12 15:12:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31748 states, 31747 states have (on average 1.1612435820707467) internal successors, (36866), 31747 states have internal predecessors, (36866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2024-10-12 15:12:23,418 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2024-10-12 15:12:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:23,418 INFO L471 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2024-10-12 15:12:23,419 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-10-12 15:12:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2024-10-12 15:12:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 15:12:23,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:23,436 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-10-12 15:12:23,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 15:12:23,437 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:23,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1287388257, now seen corresponding path program 1 times [2024-10-12 15:12:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976592777] [2024-10-12 15:12:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:23,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976592777] [2024-10-12 15:12:23,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976592777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:23,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:23,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406740959] [2024-10-12 15:12:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:23,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:23,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:23,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:23,462 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 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-10-12 15:12:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:24,214 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2024-10-12 15:12:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:24,215 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-10-12 15:12:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:24,263 INFO L225 Difference]: With dead ends: 92166 [2024-10-12 15:12:24,263 INFO L226 Difference]: Without dead ends: 31748 [2024-10-12 15:12:24,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:24,423 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:24,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 135 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2024-10-12 15:12:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2024-10-12 15:12:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31748 states, 31747 states have (on average 1.0967335496267363) internal successors, (34818), 31747 states have internal predecessors, (34818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2024-10-12 15:12:25,052 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2024-10-12 15:12:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:25,053 INFO L471 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2024-10-12 15:12:25,053 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-10-12 15:12:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2024-10-12 15:12:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 15:12:25,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:25,074 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-10-12 15:12:25,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 15:12:25,074 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:25,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -276271007, now seen corresponding path program 1 times [2024-10-12 15:12:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384220253] [2024-10-12 15:12:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:25,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384220253] [2024-10-12 15:12:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384220253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13557991] [2024-10-12 15:12:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:25,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:25,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:25,102 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 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-10-12 15:12:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:25,618 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2024-10-12 15:12:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:25,619 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-10-12 15:12:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:25,623 INFO L225 Difference]: With dead ends: 31748 [2024-10-12 15:12:25,624 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:12:25,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:25,635 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 75 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-10-12 15:12:25,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 75 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:12:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:12:25,637 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-10-12 15:12:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:12:25,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-10-12 15:12:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:25,642 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:12:25,642 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-10-12 15:12:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:12:25,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:12:25,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:12:25,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 15:12:25,651 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-10-12 15:12:25,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:12:25,673 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:12:25,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:12:25 BoogieIcfgContainer [2024-10-12 15:12:25,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:12:25,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:12:25,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:12:25,689 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:12:25,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:12:13" (3/4) ... [2024-10-12 15:12:25,692 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:12:25,699 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 15:12:25,700 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:12:25,700 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:12:25,700 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:12:25,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:12:25,791 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:12:25,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:12:25,791 INFO L158 Benchmark]: Toolchain (without parser) took 13573.31ms. Allocated memory was 163.6MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 118.4MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 460.4MB. Max. memory is 16.1GB. [2024-10-12 15:12:25,792 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:12:25,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.55ms. Allocated memory is still 163.6MB. Free memory was 118.2MB in the beginning and 105.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:12:25,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.29ms. Allocated memory is still 163.6MB. Free memory was 105.1MB in the beginning and 103.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:12:25,792 INFO L158 Benchmark]: Boogie Preprocessor took 64.83ms. Allocated memory is still 163.6MB. Free memory was 103.3MB in the beginning and 101.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:12:25,793 INFO L158 Benchmark]: RCFGBuilder took 414.64ms. Allocated memory is still 163.6MB. Free memory was 101.2MB in the beginning and 84.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 15:12:25,793 INFO L158 Benchmark]: TraceAbstraction took 12678.65ms. Allocated memory was 163.6MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 83.7MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 418.4MB. Max. memory is 16.1GB. [2024-10-12 15:12:25,793 INFO L158 Benchmark]: Witness Printer took 101.87ms. Allocated memory is still 6.0GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:12:25,794 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.22ms. Allocated memory is still 163.6MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.55ms. Allocated memory is still 163.6MB. Free memory was 118.2MB in the beginning and 105.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.29ms. Allocated memory is still 163.6MB. Free memory was 105.1MB in the beginning and 103.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.83ms. Allocated memory is still 163.6MB. Free memory was 103.3MB in the beginning and 101.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.64ms. Allocated memory is still 163.6MB. Free memory was 101.2MB in the beginning and 84.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12678.65ms. Allocated memory was 163.6MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 83.7MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 418.4MB. Max. memory is 16.1GB. * Witness Printer took 101.87ms. Allocated memory is still 6.0GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1398 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1398 mSDsluCounter, 4489 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1802 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2687 mSDtfsCounter, 198 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=31748occurred in iteration=29, 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.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 1461 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]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-12 15:12:25,825 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