./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_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:30:28,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:30:28,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:30:28,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:30:28,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:30:28,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:30:28,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:30:28,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:30:28,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:30:28,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:30:28,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:30:28,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:30:28,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:30:28,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:30:28,273 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:30:28,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:30:28,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:30:28,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:30:28,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:30:28,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:30:28,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:30:28,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:30:28,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:30:28,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:30:28,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:30:28,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:30:28,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:30:28,276 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:30:28,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:30:28,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:30:28,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:30:28,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:30:28,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:28,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:30:28,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:30:28,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:30:28,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:30:28,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:30:28,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:30:28,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:30:28,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:30:28,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:30:28,279 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-clean/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-clean/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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2024-10-10 22:30:28,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:30:28,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:30:28,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:30:28,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:30:28,505 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:30:28,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2024-10-10 22:30:29,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:30:30,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:30:30,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2024-10-10 22:30:30,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5fdec5216/e7f2b76a4c604196a20d09583624ab69/FLAG15ce0d2e4 [2024-10-10 22:30:30,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5fdec5216/e7f2b76a4c604196a20d09583624ab69 [2024-10-10 22:30:30,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:30:30,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:30:30,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:30,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:30:30,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:30:30,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c46e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30, skipping insertion in model container [2024-10-10 22:30:30,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:30:30,604 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_10.c[3901,3914] [2024-10-10 22:30:30,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:30,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:30:30,644 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_10.c[3901,3914] [2024-10-10 22:30:30,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:30,665 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:30:30,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30 WrapperNode [2024-10-10 22:30:30,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:30,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:30,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:30:30,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:30:30,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,749 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2024-10-10 22:30:30,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:30,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:30:30,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:30:30,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:30:30,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,785 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-10 22:30:30,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:30:30,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:30:30,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:30:30,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:30:30,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (1/1) ... [2024-10-10 22:30:30,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:30,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:30,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:30:30,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:30:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:30:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:30:30,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:30:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:30:30,946 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:30:30,948 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:30:31,085 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-10 22:30:31,086 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:30:31,105 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:30:31,105 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:30:31,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:31 BoogieIcfgContainer [2024-10-10 22:30:31,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:30:31,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:30:31,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:30:31,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:30:31,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:30:30" (1/3) ... [2024-10-10 22:30:31,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12596f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:31, skipping insertion in model container [2024-10-10 22:30:31,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:30" (2/3) ... [2024-10-10 22:30:31,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12596f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:31, skipping insertion in model container [2024-10-10 22:30:31,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:31" (3/3) ... [2024-10-10 22:30:31,112 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2024-10-10 22:30:31,125 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:30:31,125 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:30:31,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:30:31,184 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;@486f1441, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:30:31,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:30:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-10 22:30:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:30:31,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:31,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1223280439, now seen corresponding path program 1 times [2024-10-10 22:30:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750938877] [2024-10-10 22:30:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,347 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-10 22:30:31,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750938877] [2024-10-10 22:30:31,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750938877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374664966] [2024-10-10 22:30:31,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,379 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 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.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-10 22:30:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:31,419 INFO L93 Difference]: Finished difference Result 78 states and 141 transitions. [2024-10-10 22:30:31,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:31,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:30:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:31,432 INFO L225 Difference]: With dead ends: 78 [2024-10-10 22:30:31,433 INFO L226 Difference]: Without dead ends: 68 [2024-10-10 22:30:31,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-10 22:30:31,437 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 50 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 130 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-10 22:30:31,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 130 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-10 22:30:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2024-10-10 22:30:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-10 22:30:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2024-10-10 22:30:31,461 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2024-10-10 22:30:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:31,462 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2024-10-10 22:30:31,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-10 22:30:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2024-10-10 22:30:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:30:31,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:31,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:30:31,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash 636474425, now seen corresponding path program 1 times [2024-10-10 22:30:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758999158] [2024-10-10 22:30:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,536 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-10 22:30:31,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758999158] [2024-10-10 22:30:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758999158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157675450] [2024-10-10 22:30:31,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,538 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-10 22:30:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:31,575 INFO L93 Difference]: Finished difference Result 113 states and 208 transitions. [2024-10-10 22:30:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:31,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:30:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:31,576 INFO L225 Difference]: With dead ends: 113 [2024-10-10 22:30:31,576 INFO L226 Difference]: Without dead ends: 68 [2024-10-10 22:30:31,577 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-10 22:30:31,577 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 48 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 140 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-10 22:30:31,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 140 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-10 22:30:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-10 22:30:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 65 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2024-10-10 22:30:31,584 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 16 [2024-10-10 22:30:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:31,584 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2024-10-10 22:30:31,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-10 22:30:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2024-10-10 22:30:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:30:31,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:31,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:30:31,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,585 INFO L85 PathProgramCache]: Analyzing trace with hash -732798707, now seen corresponding path program 1 times [2024-10-10 22:30:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284541549] [2024-10-10 22:30:31,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,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-10 22:30:31,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284541549] [2024-10-10 22:30:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284541549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687292834] [2024-10-10 22:30:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,629 INFO L87 Difference]: Start difference. First operand 66 states and 121 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-10 22:30:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:31,655 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2024-10-10 22:30:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:31,655 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-10 22:30:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:31,656 INFO L225 Difference]: With dead ends: 104 [2024-10-10 22:30:31,656 INFO L226 Difference]: Without dead ends: 71 [2024-10-10 22:30:31,657 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-10 22:30:31,657 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 50 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 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-10 22:30:31,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-10 22:30:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-10 22:30:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 68 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:30:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 123 transitions. [2024-10-10 22:30:31,671 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 123 transitions. Word has length 17 [2024-10-10 22:30:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:31,671 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 123 transitions. [2024-10-10 22:30:31,671 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-10 22:30:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2024-10-10 22:30:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:30:31,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:31,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:30:31,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1743915957, now seen corresponding path program 1 times [2024-10-10 22:30:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424929227] [2024-10-10 22:30:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,712 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-10 22:30:31,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424929227] [2024-10-10 22:30:31,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424929227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778273285] [2024-10-10 22:30:31,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,715 INFO L87 Difference]: Start difference. First operand 69 states and 123 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-10 22:30:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:31,727 INFO L93 Difference]: Finished difference Result 132 states and 236 transitions. [2024-10-10 22:30:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:31,728 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-10 22:30:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:31,729 INFO L225 Difference]: With dead ends: 132 [2024-10-10 22:30:31,729 INFO L226 Difference]: Without dead ends: 130 [2024-10-10 22:30:31,729 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-10 22:30:31,730 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 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-10 22:30:31,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 122 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-10 22:30:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2024-10-10 22:30:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.8021978021978022) internal successors, (164), 91 states have internal predecessors, (164), 0 states have call successors, (0), 0 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-10 22:30:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2024-10-10 22:30:31,738 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 17 [2024-10-10 22:30:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:31,738 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2024-10-10 22:30:31,738 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-10 22:30:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2024-10-10 22:30:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:30:31,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:31,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:30:31,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1964245325, now seen corresponding path program 1 times [2024-10-10 22:30:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301624738] [2024-10-10 22:30:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,776 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-10 22:30:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301624738] [2024-10-10 22:30:31,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301624738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419481197] [2024-10-10 22:30:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,779 INFO L87 Difference]: Start difference. First operand 92 states and 164 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-10 22:30:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:31,812 INFO L93 Difference]: Finished difference Result 220 states and 394 transitions. [2024-10-10 22:30:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:31,813 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-10 22:30:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:31,814 INFO L225 Difference]: With dead ends: 220 [2024-10-10 22:30:31,814 INFO L226 Difference]: Without dead ends: 132 [2024-10-10 22:30:31,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,815 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 141 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-10 22:30:31,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 141 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-10 22:30:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-10-10 22:30:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.7829457364341086) internal successors, (230), 129 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-10 22:30:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 230 transitions. [2024-10-10 22:30:31,821 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 230 transitions. Word has length 17 [2024-10-10 22:30:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:31,821 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 230 transitions. [2024-10-10 22:30:31,822 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-10 22:30:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 230 transitions. [2024-10-10 22:30:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-10 22:30:31,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,822 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-10 22:30:31,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:30:31,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1773393870, now seen corresponding path program 1 times [2024-10-10 22:30:31,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123552364] [2024-10-10 22:30:31,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,850 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-10 22:30:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123552364] [2024-10-10 22:30:31,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123552364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494091406] [2024-10-10 22:30:31,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,852 INFO L87 Difference]: Start difference. First operand 130 states and 230 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-10 22:30:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:31,861 INFO L93 Difference]: Finished difference Result 197 states and 345 transitions. [2024-10-10 22:30:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:31,862 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-10 22:30:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:31,862 INFO L225 Difference]: With dead ends: 197 [2024-10-10 22:30:31,863 INFO L226 Difference]: Without dead ends: 134 [2024-10-10 22:30:31,863 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-10 22:30:31,863 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 49 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 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-10 22:30:31,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-10 22:30:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2024-10-10 22:30:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.7557251908396947) internal successors, (230), 131 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-10 22:30:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2024-10-10 22:30:31,869 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 18 [2024-10-10 22:30:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:31,869 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2024-10-10 22:30:31,869 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-10 22:30:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2024-10-10 22:30:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-10 22:30:31,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,870 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-10 22:30:31,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:30:31,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash 762276620, now seen corresponding path program 1 times [2024-10-10 22:30:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799232793] [2024-10-10 22:30:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799232793] [2024-10-10 22:30:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799232793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876607319] [2024-10-10 22:30:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,895 INFO L87 Difference]: Start difference. First operand 132 states and 230 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-10 22:30:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:31,906 INFO L93 Difference]: Finished difference Result 380 states and 664 transitions. [2024-10-10 22:30:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:31,906 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-10 22:30:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:31,907 INFO L225 Difference]: With dead ends: 380 [2024-10-10 22:30:31,907 INFO L226 Difference]: Without dead ends: 254 [2024-10-10 22:30:31,907 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-10 22:30:31,908 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 47 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 124 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-10 22:30:31,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 124 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-10 22:30:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2024-10-10 22:30:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.7290836653386454) internal successors, (434), 251 states have internal predecessors, (434), 0 states have call successors, (0), 0 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-10 22:30:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 434 transitions. [2024-10-10 22:30:31,918 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 434 transitions. Word has length 18 [2024-10-10 22:30:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:31,918 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 434 transitions. [2024-10-10 22:30:31,918 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-10 22:30:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 434 transitions. [2024-10-10 22:30:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-10 22:30:31,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,919 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-10 22:30:31,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:30:31,920 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1349082634, now seen corresponding path program 1 times [2024-10-10 22:30:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393933317] [2024-10-10 22:30:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,940 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-10 22:30:31,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393933317] [2024-10-10 22:30:31,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393933317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433064516] [2024-10-10 22:30:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,943 INFO L87 Difference]: Start difference. First operand 252 states and 434 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-10 22:30:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:31,953 INFO L93 Difference]: Finished difference Result 320 states and 556 transitions. [2024-10-10 22:30:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:31,953 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-10 22:30:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:31,954 INFO L225 Difference]: With dead ends: 320 [2024-10-10 22:30:31,954 INFO L226 Difference]: Without dead ends: 318 [2024-10-10 22:30:31,955 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-10 22:30:31,955 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 42 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 167 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-10 22:30:31,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-10 22:30:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 252. [2024-10-10 22:30:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.7131474103585658) internal successors, (430), 251 states have internal predecessors, (430), 0 states have call successors, (0), 0 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-10 22:30:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 430 transitions. [2024-10-10 22:30:31,964 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 430 transitions. Word has length 18 [2024-10-10 22:30:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:31,964 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 430 transitions. [2024-10-10 22:30:31,964 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-10 22:30:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 430 transitions. [2024-10-10 22:30:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 22:30:31,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:31,965 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-10 22:30:31,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:30:31,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:31,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2139014526, now seen corresponding path program 1 times [2024-10-10 22:30:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:31,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152663928] [2024-10-10 22:30:31,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:31,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:31,989 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-10 22:30:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152663928] [2024-10-10 22:30:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152663928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848550799] [2024-10-10 22:30:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:31,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:31,991 INFO L87 Difference]: Start difference. First operand 252 states and 430 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-10 22:30:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,005 INFO L93 Difference]: Finished difference Result 468 states and 808 transitions. [2024-10-10 22:30:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,008 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-10 22:30:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,009 INFO L225 Difference]: With dead ends: 468 [2024-10-10 22:30:32,009 INFO L226 Difference]: Without dead ends: 466 [2024-10-10 22:30:32,010 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-10 22:30:32,010 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 39 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 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-10 22:30:32,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-10 22:30:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 352. [2024-10-10 22:30:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.6809116809116809) internal successors, (590), 351 states have internal predecessors, (590), 0 states have call successors, (0), 0 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-10 22:30:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 590 transitions. [2024-10-10 22:30:32,032 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 590 transitions. Word has length 19 [2024-10-10 22:30:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,032 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 590 transitions. [2024-10-10 22:30:32,032 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-10 22:30:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 590 transitions. [2024-10-10 22:30:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 22:30:32,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,033 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-10 22:30:32,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:30:32,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1569146756, now seen corresponding path program 1 times [2024-10-10 22:30:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609614968] [2024-10-10 22:30:32,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,055 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-10 22:30:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609614968] [2024-10-10 22:30:32,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609614968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190862398] [2024-10-10 22:30:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,057 INFO L87 Difference]: Start difference. First operand 352 states and 590 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-10 22:30:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,070 INFO L93 Difference]: Finished difference Result 836 states and 1408 transitions. [2024-10-10 22:30:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,071 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-10 22:30:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,072 INFO L225 Difference]: With dead ends: 836 [2024-10-10 22:30:32,072 INFO L226 Difference]: Without dead ends: 490 [2024-10-10 22:30:32,073 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-10 22:30:32,074 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 45 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 143 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-10 22:30:32,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-10 22:30:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2024-10-10 22:30:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.6632443531827514) internal successors, (810), 487 states have internal predecessors, (810), 0 states have call successors, (0), 0 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-10 22:30:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2024-10-10 22:30:32,086 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 19 [2024-10-10 22:30:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,087 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2024-10-10 22:30:32,087 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-10 22:30:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2024-10-10 22:30:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:30:32,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,088 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-10 22:30:32,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:30:32,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1884726495, now seen corresponding path program 1 times [2024-10-10 22:30:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560923571] [2024-10-10 22:30:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,120 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-10 22:30:32,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560923571] [2024-10-10 22:30:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560923571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026969923] [2024-10-10 22:30:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,124 INFO L87 Difference]: Start difference. First operand 488 states and 810 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-10 22:30:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,140 INFO L93 Difference]: Finished difference Result 740 states and 1224 transitions. [2024-10-10 22:30:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,140 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-10 22:30:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,142 INFO L225 Difference]: With dead ends: 740 [2024-10-10 22:30:32,142 INFO L226 Difference]: Without dead ends: 502 [2024-10-10 22:30:32,143 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-10 22:30:32,143 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 47 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 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-10 22:30:32,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-10-10 22:30:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2024-10-10 22:30:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 1.6392785571142285) internal successors, (818), 499 states have internal predecessors, (818), 0 states have call successors, (0), 0 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-10 22:30:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 818 transitions. [2024-10-10 22:30:32,154 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 818 transitions. Word has length 20 [2024-10-10 22:30:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,154 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 818 transitions. [2024-10-10 22:30:32,154 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-10 22:30:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 818 transitions. [2024-10-10 22:30:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:30:32,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,155 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-10 22:30:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:30:32,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1399123551, now seen corresponding path program 1 times [2024-10-10 22:30:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672429545] [2024-10-10 22:30:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,185 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-10 22:30:32,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672429545] [2024-10-10 22:30:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672429545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691842679] [2024-10-10 22:30:32,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,187 INFO L87 Difference]: Start difference. First operand 500 states and 818 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-10 22:30:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,211 INFO L93 Difference]: Finished difference Result 904 states and 1500 transitions. [2024-10-10 22:30:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,211 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-10 22:30:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,214 INFO L225 Difference]: With dead ends: 904 [2024-10-10 22:30:32,217 INFO L226 Difference]: Without dead ends: 902 [2024-10-10 22:30:32,217 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-10 22:30:32,220 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 116 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-10 22:30:32,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 116 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-10 22:30:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 708. [2024-10-10 22:30:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.5983026874115982) internal successors, (1130), 707 states have internal predecessors, (1130), 0 states have call successors, (0), 0 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-10 22:30:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1130 transitions. [2024-10-10 22:30:32,237 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1130 transitions. Word has length 20 [2024-10-10 22:30:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,237 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1130 transitions. [2024-10-10 22:30:32,237 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-10 22:30:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1130 transitions. [2024-10-10 22:30:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:30:32,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,239 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-10 22:30:32,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:30:32,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,239 INFO L85 PathProgramCache]: Analyzing trace with hash 812317537, now seen corresponding path program 1 times [2024-10-10 22:30:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334413621] [2024-10-10 22:30:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,301 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-10 22:30:32,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334413621] [2024-10-10 22:30:32,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334413621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877546928] [2024-10-10 22:30:32,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,303 INFO L87 Difference]: Start difference. First operand 708 states and 1130 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-10 22:30:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,325 INFO L93 Difference]: Finished difference Result 1656 states and 2652 transitions. [2024-10-10 22:30:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,326 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-10 22:30:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,328 INFO L225 Difference]: With dead ends: 1656 [2024-10-10 22:30:32,328 INFO L226 Difference]: Without dead ends: 966 [2024-10-10 22:30:32,328 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-10 22:30:32,329 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 144 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-10 22:30:32,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 144 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-10-10 22:30:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2024-10-10 22:30:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 1.5804776739356179) internal successors, (1522), 963 states have internal predecessors, (1522), 0 states have call successors, (0), 0 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-10 22:30:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1522 transitions. [2024-10-10 22:30:32,346 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1522 transitions. Word has length 20 [2024-10-10 22:30:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,346 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1522 transitions. [2024-10-10 22:30:32,346 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-10 22:30:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1522 transitions. [2024-10-10 22:30:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:30:32,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,347 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-10 22:30:32,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:30:32,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash 423371833, now seen corresponding path program 1 times [2024-10-10 22:30:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520396975] [2024-10-10 22:30:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,362 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-10 22:30:32,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520396975] [2024-10-10 22:30:32,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520396975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909623466] [2024-10-10 22:30:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,363 INFO L87 Difference]: Start difference. First operand 964 states and 1522 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-10 22:30:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,382 INFO L93 Difference]: Finished difference Result 1448 states and 2276 transitions. [2024-10-10 22:30:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,382 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-10 22:30:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,384 INFO L225 Difference]: With dead ends: 1448 [2024-10-10 22:30:32,384 INFO L226 Difference]: Without dead ends: 982 [2024-10-10 22:30:32,385 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-10 22:30:32,385 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 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-10 22:30:32,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 141 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-10 22:30:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2024-10-10 22:30:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 1.5546475995914197) internal successors, (1522), 979 states have internal predecessors, (1522), 0 states have call successors, (0), 0 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-10 22:30:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1522 transitions. [2024-10-10 22:30:32,402 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1522 transitions. Word has length 21 [2024-10-10 22:30:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,402 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1522 transitions. [2024-10-10 22:30:32,402 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-10 22:30:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1522 transitions. [2024-10-10 22:30:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:30:32,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,403 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-10 22:30:32,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:30:32,404 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,404 INFO L85 PathProgramCache]: Analyzing trace with hash -587745417, now seen corresponding path program 1 times [2024-10-10 22:30:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074601729] [2024-10-10 22:30:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,418 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-10 22:30:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074601729] [2024-10-10 22:30:32,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074601729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406203856] [2024-10-10 22:30:32,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,420 INFO L87 Difference]: Start difference. First operand 980 states and 1522 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-10 22:30:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,444 INFO L93 Difference]: Finished difference Result 1736 states and 2740 transitions. [2024-10-10 22:30:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,444 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-10 22:30:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,448 INFO L225 Difference]: With dead ends: 1736 [2024-10-10 22:30:32,448 INFO L226 Difference]: Without dead ends: 1734 [2024-10-10 22:30:32,449 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-10 22:30:32,449 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 114 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-10 22:30:32,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 114 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-10-10 22:30:32,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1412. [2024-10-10 22:30:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.5095676824946846) internal successors, (2130), 1411 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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-10 22:30:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2130 transitions. [2024-10-10 22:30:32,472 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2130 transitions. Word has length 21 [2024-10-10 22:30:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,472 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2130 transitions. [2024-10-10 22:30:32,472 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-10 22:30:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2130 transitions. [2024-10-10 22:30:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:30:32,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,474 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-10 22:30:32,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:30:32,474 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1174551431, now seen corresponding path program 1 times [2024-10-10 22:30:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243580480] [2024-10-10 22:30:32,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,489 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-10 22:30:32,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243580480] [2024-10-10 22:30:32,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243580480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930459215] [2024-10-10 22:30:32,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,490 INFO L87 Difference]: Start difference. First operand 1412 states and 2130 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-10 22:30:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,537 INFO L93 Difference]: Finished difference Result 3272 states and 4948 transitions. [2024-10-10 22:30:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,537 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-10 22:30:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,542 INFO L225 Difference]: With dead ends: 3272 [2024-10-10 22:30:32,542 INFO L226 Difference]: Without dead ends: 1894 [2024-10-10 22:30:32,543 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-10 22:30:32,543 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 145 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-10 22:30:32,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 145 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2024-10-10 22:30:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2024-10-10 22:30:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1891 states have (on average 1.4902168164992067) internal successors, (2818), 1891 states have internal predecessors, (2818), 0 states have call successors, (0), 0 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-10 22:30:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2818 transitions. [2024-10-10 22:30:32,595 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2818 transitions. Word has length 21 [2024-10-10 22:30:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,596 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2818 transitions. [2024-10-10 22:30:32,596 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-10 22:30:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2818 transitions. [2024-10-10 22:30:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:30:32,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,597 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-10 22:30:32,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:30:32,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1040023690, now seen corresponding path program 1 times [2024-10-10 22:30:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274846093] [2024-10-10 22:30:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,615 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-10 22:30:32,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274846093] [2024-10-10 22:30:32,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274846093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920844571] [2024-10-10 22:30:32,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,617 INFO L87 Difference]: Start difference. First operand 1892 states and 2818 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-10 22:30:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,657 INFO L93 Difference]: Finished difference Result 2840 states and 4212 transitions. [2024-10-10 22:30:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,657 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-10 22:30:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,661 INFO L225 Difference]: With dead ends: 2840 [2024-10-10 22:30:32,662 INFO L226 Difference]: Without dead ends: 1926 [2024-10-10 22:30:32,662 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-10 22:30:32,663 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 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-10 22:30:32,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2024-10-10 22:30:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2024-10-10 22:30:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1923 states have (on average 1.4654186167446699) internal successors, (2818), 1923 states have internal predecessors, (2818), 0 states have call successors, (0), 0 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-10 22:30:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2818 transitions. [2024-10-10 22:30:32,698 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2818 transitions. Word has length 22 [2024-10-10 22:30:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,698 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2818 transitions. [2024-10-10 22:30:32,698 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-10 22:30:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2818 transitions. [2024-10-10 22:30:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:30:32,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,699 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-10 22:30:32,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 22:30:32,699 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2051140940, now seen corresponding path program 1 times [2024-10-10 22:30:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762752853] [2024-10-10 22:30:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,712 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-10 22:30:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762752853] [2024-10-10 22:30:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762752853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037429562] [2024-10-10 22:30:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,713 INFO L87 Difference]: Start difference. First operand 1924 states and 2818 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-10 22:30:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,759 INFO L93 Difference]: Finished difference Result 3336 states and 4964 transitions. [2024-10-10 22:30:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,759 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-10 22:30:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,767 INFO L225 Difference]: With dead ends: 3336 [2024-10-10 22:30:32,767 INFO L226 Difference]: Without dead ends: 3334 [2024-10-10 22:30:32,768 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-10 22:30:32,768 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 112 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-10 22:30:32,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 112 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2024-10-10 22:30:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2820. [2024-10-10 22:30:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2819 states have (on average 1.4196523589925505) internal successors, (4002), 2819 states have internal predecessors, (4002), 0 states have call successors, (0), 0 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-10 22:30:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4002 transitions. [2024-10-10 22:30:32,849 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4002 transitions. Word has length 22 [2024-10-10 22:30:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:32,849 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 4002 transitions. [2024-10-10 22:30:32,849 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-10 22:30:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4002 transitions. [2024-10-10 22:30:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:30:32,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:32,852 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-10 22:30:32,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:30:32,852 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:32,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1657020342, now seen corresponding path program 1 times [2024-10-10 22:30:32,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:32,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041127739] [2024-10-10 22:30:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:32,867 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-10 22:30:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041127739] [2024-10-10 22:30:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041127739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:32,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:32,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486254027] [2024-10-10 22:30:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:32,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:32,869 INFO L87 Difference]: Start difference. First operand 2820 states and 4002 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-10 22:30:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:32,930 INFO L93 Difference]: Finished difference Result 6472 states and 9188 transitions. [2024-10-10 22:30:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:32,931 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-10 22:30:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:32,940 INFO L225 Difference]: With dead ends: 6472 [2024-10-10 22:30:32,940 INFO L226 Difference]: Without dead ends: 3718 [2024-10-10 22:30:32,943 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-10 22:30:32,943 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 146 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-10 22:30:32,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 146 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2024-10-10 22:30:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2024-10-10 22:30:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 3715 states have (on average 1.3959623149394347) internal successors, (5186), 3715 states have internal predecessors, (5186), 0 states have call successors, (0), 0 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-10 22:30:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 5186 transitions. [2024-10-10 22:30:33,052 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 5186 transitions. Word has length 22 [2024-10-10 22:30:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:33,052 INFO L471 AbstractCegarLoop]: Abstraction has 3716 states and 5186 transitions. [2024-10-10 22:30:33,052 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-10 22:30:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 5186 transitions. [2024-10-10 22:30:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:30:33,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:33,054 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-10 22:30:33,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:30:33,055 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:33,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:33,055 INFO L85 PathProgramCache]: Analyzing trace with hash 839355694, now seen corresponding path program 1 times [2024-10-10 22:30:33,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:33,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249162645] [2024-10-10 22:30:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:33,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:33,074 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-10 22:30:33,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:33,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249162645] [2024-10-10 22:30:33,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249162645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:33,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:33,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:33,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604299588] [2024-10-10 22:30:33,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:33,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:33,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:33,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:33,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:33,075 INFO L87 Difference]: Start difference. First operand 3716 states and 5186 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-10 22:30:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:33,126 INFO L93 Difference]: Finished difference Result 5576 states and 7748 transitions. [2024-10-10 22:30:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:33,126 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-10 22:30:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:33,135 INFO L225 Difference]: With dead ends: 5576 [2024-10-10 22:30:33,135 INFO L226 Difference]: Without dead ends: 3782 [2024-10-10 22:30:33,137 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-10 22:30:33,138 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 133 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-10 22:30:33,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2024-10-10 22:30:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3780. [2024-10-10 22:30:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3779 states have (on average 1.372320719767134) internal successors, (5186), 3779 states have internal predecessors, (5186), 0 states have call successors, (0), 0 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-10 22:30:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5186 transitions. [2024-10-10 22:30:33,218 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5186 transitions. Word has length 23 [2024-10-10 22:30:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:33,218 INFO L471 AbstractCegarLoop]: Abstraction has 3780 states and 5186 transitions. [2024-10-10 22:30:33,218 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-10 22:30:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5186 transitions. [2024-10-10 22:30:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:30:33,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:33,222 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-10 22:30:33,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:30:33,222 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:33,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash -171761556, now seen corresponding path program 1 times [2024-10-10 22:30:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275777758] [2024-10-10 22:30:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:33,243 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-10 22:30:33,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:33,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275777758] [2024-10-10 22:30:33,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275777758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:33,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:33,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:33,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243599631] [2024-10-10 22:30:33,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:33,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:33,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:33,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:33,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:33,244 INFO L87 Difference]: Start difference. First operand 3780 states and 5186 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-10 22:30:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:33,328 INFO L93 Difference]: Finished difference Result 6408 states and 8900 transitions. [2024-10-10 22:30:33,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:33,329 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-10 22:30:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:33,348 INFO L225 Difference]: With dead ends: 6408 [2024-10-10 22:30:33,348 INFO L226 Difference]: Without dead ends: 6406 [2024-10-10 22:30:33,349 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-10 22:30:33,350 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 110 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-10 22:30:33,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 110 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2024-10-10 22:30:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5636. [2024-10-10 22:30:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5636 states, 5635 states have (on average 1.329192546583851) internal successors, (7490), 5635 states have internal predecessors, (7490), 0 states have call successors, (0), 0 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-10 22:30:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7490 transitions. [2024-10-10 22:30:33,480 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7490 transitions. Word has length 23 [2024-10-10 22:30:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:33,481 INFO L471 AbstractCegarLoop]: Abstraction has 5636 states and 7490 transitions. [2024-10-10 22:30:33,481 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-10 22:30:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7490 transitions. [2024-10-10 22:30:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:30:33,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:33,486 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-10 22:30:33,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:30:33,486 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:33,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash -758567570, now seen corresponding path program 1 times [2024-10-10 22:30:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:33,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700861056] [2024-10-10 22:30:33,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:33,503 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-10 22:30:33,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:33,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700861056] [2024-10-10 22:30:33,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700861056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:33,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:33,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:33,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013579474] [2024-10-10 22:30:33,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:33,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:33,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:33,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:33,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:33,505 INFO L87 Difference]: Start difference. First operand 5636 states and 7490 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-10 22:30:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:33,620 INFO L93 Difference]: Finished difference Result 12808 states and 16964 transitions. [2024-10-10 22:30:33,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:33,620 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-10 22:30:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:33,629 INFO L225 Difference]: With dead ends: 12808 [2024-10-10 22:30:33,629 INFO L226 Difference]: Without dead ends: 7302 [2024-10-10 22:30:33,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-10 22:30:33,634 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 147 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-10 22:30:33,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 147 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2024-10-10 22:30:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7300. [2024-10-10 22:30:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7300 states, 7299 states have (on average 1.297986025482943) internal successors, (9474), 7299 states have internal predecessors, (9474), 0 states have call successors, (0), 0 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-10 22:30:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 9474 transitions. [2024-10-10 22:30:33,820 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 9474 transitions. Word has length 23 [2024-10-10 22:30:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:33,820 INFO L471 AbstractCegarLoop]: Abstraction has 7300 states and 9474 transitions. [2024-10-10 22:30:33,820 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-10 22:30:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 9474 transitions. [2024-10-10 22:30:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:30:33,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:33,824 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-10 22:30:33,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 22:30:33,825 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1029425205, now seen corresponding path program 1 times [2024-10-10 22:30:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450470445] [2024-10-10 22:30:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:33,838 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-10 22:30:33,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:33,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450470445] [2024-10-10 22:30:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450470445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:33,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387440670] [2024-10-10 22:30:33,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:33,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:33,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:33,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:33,839 INFO L87 Difference]: Start difference. First operand 7300 states and 9474 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-10 22:30:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:33,913 INFO L93 Difference]: Finished difference Result 10952 states and 14148 transitions. [2024-10-10 22:30:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:33,913 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-10 22:30:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:33,921 INFO L225 Difference]: With dead ends: 10952 [2024-10-10 22:30:33,921 INFO L226 Difference]: Without dead ends: 7430 [2024-10-10 22:30:33,925 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-10 22:30:33,925 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 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-10 22:30:33,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2024-10-10 22:30:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 7428. [2024-10-10 22:30:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7428 states, 7427 states have (on average 1.2756159956913962) internal successors, (9474), 7427 states have internal predecessors, (9474), 0 states have call successors, (0), 0 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-10 22:30:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 9474 transitions. [2024-10-10 22:30:34,095 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 9474 transitions. Word has length 24 [2024-10-10 22:30:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:34,095 INFO L471 AbstractCegarLoop]: Abstraction has 7428 states and 9474 transitions. [2024-10-10 22:30:34,095 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-10 22:30:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 9474 transitions. [2024-10-10 22:30:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:30:34,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:34,099 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-10 22:30:34,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 22:30:34,100 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2040542455, now seen corresponding path program 1 times [2024-10-10 22:30:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:34,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659319544] [2024-10-10 22:30:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:34,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:34,118 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-10 22:30:34,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659319544] [2024-10-10 22:30:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659319544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:34,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:34,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142013465] [2024-10-10 22:30:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:34,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:34,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:34,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:34,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:34,119 INFO L87 Difference]: Start difference. First operand 7428 states and 9474 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-10 22:30:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:34,247 INFO L93 Difference]: Finished difference Result 12296 states and 15748 transitions. [2024-10-10 22:30:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:34,247 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-10 22:30:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:34,259 INFO L225 Difference]: With dead ends: 12296 [2024-10-10 22:30:34,259 INFO L226 Difference]: Without dead ends: 12294 [2024-10-10 22:30:34,260 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-10 22:30:34,261 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 108 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-10 22:30:34,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 108 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2024-10-10 22:30:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11268. [2024-10-10 22:30:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11268 states, 11267 states have (on average 1.2384840685186829) internal successors, (13954), 11267 states have internal predecessors, (13954), 0 states have call successors, (0), 0 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-10 22:30:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13954 transitions. [2024-10-10 22:30:34,484 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13954 transitions. Word has length 24 [2024-10-10 22:30:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:34,484 INFO L471 AbstractCegarLoop]: Abstraction has 11268 states and 13954 transitions. [2024-10-10 22:30:34,484 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-10 22:30:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13954 transitions. [2024-10-10 22:30:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:30:34,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:34,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:34,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 22:30:34,495 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:34,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:34,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1667618827, now seen corresponding path program 1 times [2024-10-10 22:30:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:34,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187946212] [2024-10-10 22:30:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:34,510 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-10 22:30:34,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:34,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187946212] [2024-10-10 22:30:34,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187946212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:34,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864634011] [2024-10-10 22:30:34,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:34,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:34,511 INFO L87 Difference]: Start difference. First operand 11268 states and 13954 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-10 22:30:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:34,796 INFO L93 Difference]: Finished difference Result 25352 states and 31108 transitions. [2024-10-10 22:30:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:34,796 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-10 22:30:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:34,813 INFO L225 Difference]: With dead ends: 25352 [2024-10-10 22:30:34,813 INFO L226 Difference]: Without dead ends: 14342 [2024-10-10 22:30:34,823 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-10 22:30:34,824 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 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-10 22:30:34,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2024-10-10 22:30:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 14340. [2024-10-10 22:30:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14340 states, 14339 states have (on average 1.1963177348490133) internal successors, (17154), 14339 states have internal predecessors, (17154), 0 states have call successors, (0), 0 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-10 22:30:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 17154 transitions. [2024-10-10 22:30:35,059 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 17154 transitions. Word has length 24 [2024-10-10 22:30:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:35,059 INFO L471 AbstractCegarLoop]: Abstraction has 14340 states and 17154 transitions. [2024-10-10 22:30:35,059 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-10 22:30:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 17154 transitions. [2024-10-10 22:30:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:30:35,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:35,070 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-10 22:30:35,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 22:30:35,070 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:35,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1167909411, now seen corresponding path program 1 times [2024-10-10 22:30:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:35,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529396840] [2024-10-10 22:30:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:35,085 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-10 22:30:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529396840] [2024-10-10 22:30:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529396840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:35,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:35,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:35,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716923586] [2024-10-10 22:30:35,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:35,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:35,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:35,086 INFO L87 Difference]: Start difference. First operand 14340 states and 17154 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-10 22:30:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:35,246 INFO L93 Difference]: Finished difference Result 21512 states and 25604 transitions. [2024-10-10 22:30:35,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:35,246 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-10 22:30:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:35,261 INFO L225 Difference]: With dead ends: 21512 [2024-10-10 22:30:35,262 INFO L226 Difference]: Without dead ends: 14598 [2024-10-10 22:30:35,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:35,268 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 125 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-10 22:30:35,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2024-10-10 22:30:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2024-10-10 22:30:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14596 states, 14595 states have (on average 1.175334018499486) internal successors, (17154), 14595 states have internal predecessors, (17154), 0 states have call successors, (0), 0 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-10 22:30:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 17154 transitions. [2024-10-10 22:30:35,534 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 17154 transitions. Word has length 25 [2024-10-10 22:30:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:35,534 INFO L471 AbstractCegarLoop]: Abstraction has 14596 states and 17154 transitions. [2024-10-10 22:30:35,534 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-10 22:30:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 17154 transitions. [2024-10-10 22:30:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:30:35,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:35,544 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-10 22:30:35,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-10 22:30:35,544 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:35,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash 156792161, now seen corresponding path program 1 times [2024-10-10 22:30:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127326857] [2024-10-10 22:30:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:35,557 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-10 22:30:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:35,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127326857] [2024-10-10 22:30:35,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127326857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:35,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:35,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:35,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623045699] [2024-10-10 22:30:35,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:35,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:35,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:35,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:35,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:35,559 INFO L87 Difference]: Start difference. First operand 14596 states and 17154 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-10 22:30:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:35,882 INFO L93 Difference]: Finished difference Result 23558 states and 27395 transitions. [2024-10-10 22:30:35,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:35,883 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-10 22:30:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:35,914 INFO L225 Difference]: With dead ends: 23558 [2024-10-10 22:30:35,914 INFO L226 Difference]: Without dead ends: 23556 [2024-10-10 22:30:35,918 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-10 22:30:35,919 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 20 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 105 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-10 22:30:35,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23556 states. [2024-10-10 22:30:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23556 to 22532. [2024-10-10 22:30:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22532 states, 22531 states have (on average 1.147663219564156) internal successors, (25858), 22531 states have internal predecessors, (25858), 0 states have call successors, (0), 0 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-10 22:30:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 25858 transitions. [2024-10-10 22:30:36,360 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 25858 transitions. Word has length 25 [2024-10-10 22:30:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:36,361 INFO L471 AbstractCegarLoop]: Abstraction has 22532 states and 25858 transitions. [2024-10-10 22:30:36,361 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-10 22:30:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 25858 transitions. [2024-10-10 22:30:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:30:36,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:36,386 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-10 22:30:36,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-10 22:30:36,386 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:36,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash -430013853, now seen corresponding path program 1 times [2024-10-10 22:30:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:36,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535948160] [2024-10-10 22:30:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:36,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:36,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535948160] [2024-10-10 22:30:36,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535948160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:36,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:36,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:36,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235659594] [2024-10-10 22:30:36,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:36,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:36,413 INFO L87 Difference]: Start difference. First operand 22532 states and 25858 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-10 22:30:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:36,769 INFO L93 Difference]: Finished difference Result 50180 states and 56578 transitions. [2024-10-10 22:30:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:36,769 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-10 22:30:36,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:36,771 INFO L225 Difference]: With dead ends: 50180 [2024-10-10 22:30:36,771 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:30:36,793 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-10 22:30:36,794 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 147 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-10 22:30:36,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 147 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:30:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:30:36,794 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-10 22:30:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:30:36,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-10 22:30:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:36,795 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:30:36,795 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-10 22:30:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:30:36,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:30:36,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:30:36,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-10 22:30:36,805 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] [2024-10-10 22:30:36,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:30:36,819 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:30:36,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:30:36 BoogieIcfgContainer [2024-10-10 22:30:36,827 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:30:36,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:30:36,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:30:36,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:30:36,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:31" (3/4) ... [2024-10-10 22:30:36,828 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:30:36,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-10 22:30:36,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:30:36,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:30:36,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:30:36,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:30:36,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:30:36,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:30:36,906 INFO L158 Benchmark]: Toolchain (without parser) took 6482.15ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 120.6MB in the beginning and 966.8MB in the end (delta: -846.2MB). Peak memory consumption was 442.9MB. Max. memory is 16.1GB. [2024-10-10 22:30:36,906 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 104.9MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:36,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.76ms. Allocated memory is still 188.7MB. Free memory was 120.4MB in the beginning and 107.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:30:36,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.73ms. Allocated memory is still 188.7MB. Free memory was 107.6MB in the beginning and 160.6MB in the end (delta: -53.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:30:36,907 INFO L158 Benchmark]: Boogie Preprocessor took 62.60ms. Allocated memory is still 188.7MB. Free memory was 160.6MB in the beginning and 158.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:36,907 INFO L158 Benchmark]: RCFGBuilder took 289.44ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 141.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 22:30:36,910 INFO L158 Benchmark]: TraceAbstraction took 5719.18ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 141.1MB in the beginning and 972.0MB in the end (delta: -830.9MB). Peak memory consumption was 459.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:36,910 INFO L158 Benchmark]: Witness Printer took 78.62ms. Allocated memory is still 1.5GB. Free memory was 972.0MB in the beginning and 966.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:30:36,911 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.61ms. Allocated memory is still 104.9MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.76ms. Allocated memory is still 188.7MB. Free memory was 120.4MB in the beginning and 107.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.73ms. Allocated memory is still 188.7MB. Free memory was 107.6MB in the beginning and 160.6MB in the end (delta: -53.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.60ms. Allocated memory is still 188.7MB. Free memory was 160.6MB in the beginning and 158.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 289.44ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 141.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5719.18ms. Allocated memory was 188.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 141.1MB in the beginning and 972.0MB in the end (delta: -830.9MB). Peak memory consumption was 459.1MB. Max. memory is 16.1GB. * Witness Printer took 78.62ms. Allocated memory is still 1.5GB. Free memory was 972.0MB in the beginning and 966.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 163]: 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1147 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1147 mSDsluCounter, 3747 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1503 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2244 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22532occurred in iteration=27, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 1212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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: 41]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-10 22:30:36,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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