./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:00:21,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:00:21,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:00:21,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:00:21,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:00:21,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:00:21,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:00:21,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:00:21,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:00:21,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:00:21,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:00:21,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:00:21,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:00:21,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:00:21,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:00:21,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:00:21,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:00:21,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:00:21,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:00:21,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:00:21,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:00:21,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:00:21,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:00:21,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:00:21,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:00:21,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:00:21,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:00:21,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:00:21,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:00:21,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:00:21,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:00:21,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:00:21,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:00:21,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:00:21,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:00:21,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:00:21,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:00:21,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:00:21,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:00:21,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:00:21,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:00:21,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:00:21,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2024-11-11 16:00:21,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:00:21,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:00:21,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:00:21,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:00:21,689 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:00:21,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-11-11 16:00:23,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:00:23,282 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:00:23,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-11-11 16:00:23,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38650ae45/34a1efc1c02b44df8734eff27f0c7011/FLAG78954a8ba [2024-11-11 16:00:23,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38650ae45/34a1efc1c02b44df8734eff27f0c7011 [2024-11-11 16:00:23,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:00:23,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:00:23,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:00:23,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:00:23,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:00:23,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21596474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23, skipping insertion in model container [2024-11-11 16:00:23,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:00:23,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2024-11-11 16:00:23,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:00:23,659 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:00:23,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2024-11-11 16:00:23,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:00:23,727 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:00:23,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23 WrapperNode [2024-11-11 16:00:23,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:00:23,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:00:23,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:00:23,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:00:23,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,780 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 529 [2024-11-11 16:00:23,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:00:23,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:00:23,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:00:23,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:00:23,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,817 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:00:23,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:00:23,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:00:23,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:00:23,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:00:23,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (1/1) ... [2024-11-11 16:00:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:00:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:23,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:00:23,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:00:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:00:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:00:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:00:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:00:24,069 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:00:24,071 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:00:24,095 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-11 16:00:24,597 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-11-11 16:00:24,599 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-11-11 16:00:24,648 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-11 16:00:24,649 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:00:24,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:00:24,665 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:00:24,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:24 BoogieIcfgContainer [2024-11-11 16:00:24,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:00:24,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:00:24,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:00:24,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:00:24,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:00:23" (1/3) ... [2024-11-11 16:00:24,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58338e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:00:24, skipping insertion in model container [2024-11-11 16:00:24,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:23" (2/3) ... [2024-11-11 16:00:24,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58338e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:00:24, skipping insertion in model container [2024-11-11 16:00:24,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:24" (3/3) ... [2024-11-11 16:00:24,673 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2024-11-11 16:00:24,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:00:24,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:00:24,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:00:24,748 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;@684e2a93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:00:24,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:00:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.7196969696969697) internal successors, (227), 133 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 16:00:24,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:24,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:24,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:24,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 260024923, now seen corresponding path program 1 times [2024-11-11 16:00:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:24,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567692759] [2024-11-11 16:00:24,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:24,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:00:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567692759] [2024-11-11 16:00:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567692759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534780565] [2024-11-11 16:00:25,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:25,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:25,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:25,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:25,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:25,076 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.7196969696969697) internal successors, (227), 133 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:25,255 INFO L93 Difference]: Finished difference Result 263 states and 447 transitions. [2024-11-11 16:00:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:25,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-11 16:00:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:25,265 INFO L225 Difference]: With dead ends: 263 [2024-11-11 16:00:25,266 INFO L226 Difference]: Without dead ends: 121 [2024-11-11 16:00:25,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:25,271 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:25,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 336 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-11 16:00:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-11 16:00:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.525) internal successors, (183), 120 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2024-11-11 16:00:25,332 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 25 [2024-11-11 16:00:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:25,333 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2024-11-11 16:00:25,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2024-11-11 16:00:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 16:00:25,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:25,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:25,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:00:25,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:25,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash 298727515, now seen corresponding path program 1 times [2024-11-11 16:00:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:25,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956284402] [2024-11-11 16:00:25,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:00:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956284402] [2024-11-11 16:00:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956284402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:25,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893626025] [2024-11-11 16:00:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:25,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:25,484 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:25,648 INFO L93 Difference]: Finished difference Result 246 states and 376 transitions. [2024-11-11 16:00:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:25,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 16:00:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:25,651 INFO L225 Difference]: With dead ends: 246 [2024-11-11 16:00:25,651 INFO L226 Difference]: Without dead ends: 136 [2024-11-11 16:00:25,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:25,653 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:25,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 258 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-11 16:00:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-11 16:00:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.5037037037037038) internal successors, (203), 135 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 203 transitions. [2024-11-11 16:00:25,678 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 203 transitions. Word has length 37 [2024-11-11 16:00:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:25,678 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 203 transitions. [2024-11-11 16:00:25,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 203 transitions. [2024-11-11 16:00:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 16:00:25,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:25,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:25,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:00:25,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:25,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1202041694, now seen corresponding path program 1 times [2024-11-11 16:00:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767948177] [2024-11-11 16:00:25,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:25,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767948177] [2024-11-11 16:00:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767948177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:25,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312156603] [2024-11-11 16:00:25,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:25,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:25,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:25,787 INFO L87 Difference]: Start difference. First operand 136 states and 203 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:25,813 INFO L93 Difference]: Finished difference Result 287 states and 424 transitions. [2024-11-11 16:00:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2024-11-11 16:00:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:25,816 INFO L225 Difference]: With dead ends: 287 [2024-11-11 16:00:25,818 INFO L226 Difference]: Without dead ends: 162 [2024-11-11 16:00:25,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:25,820 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:25,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 335 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-11 16:00:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-11 16:00:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4658385093167703) internal successors, (236), 161 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2024-11-11 16:00:25,838 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 51 [2024-11-11 16:00:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:25,838 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2024-11-11 16:00:25,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2024-11-11 16:00:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 16:00:25,843 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:25,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:25,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:00:25,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:25,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1068028188, now seen corresponding path program 1 times [2024-11-11 16:00:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:25,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696459081] [2024-11-11 16:00:25,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:25,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696459081] [2024-11-11 16:00:25,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696459081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:25,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:25,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291229259] [2024-11-11 16:00:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:25,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:25,940 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,059 INFO L93 Difference]: Finished difference Result 304 states and 453 transitions. [2024-11-11 16:00:26,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2024-11-11 16:00:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,061 INFO L225 Difference]: With dead ends: 304 [2024-11-11 16:00:26,061 INFO L226 Difference]: Without dead ends: 179 [2024-11-11 16:00:26,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,065 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 271 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-11 16:00:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-11 16:00:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.449438202247191) internal successors, (258), 178 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 258 transitions. [2024-11-11 16:00:26,081 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 258 transitions. Word has length 51 [2024-11-11 16:00:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,082 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 258 transitions. [2024-11-11 16:00:26,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 258 transitions. [2024-11-11 16:00:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 16:00:26,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,087 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:26,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:00:26,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 116906692, now seen corresponding path program 1 times [2024-11-11 16:00:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470250925] [2024-11-11 16:00:26,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470250925] [2024-11-11 16:00:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470250925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912229265] [2024-11-11 16:00:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,188 INFO L87 Difference]: Start difference. First operand 179 states and 258 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,211 INFO L93 Difference]: Finished difference Result 483 states and 698 transitions. [2024-11-11 16:00:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 70 [2024-11-11 16:00:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,213 INFO L225 Difference]: With dead ends: 483 [2024-11-11 16:00:26,213 INFO L226 Difference]: Without dead ends: 341 [2024-11-11 16:00:26,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,217 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 130 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 341 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-11 16:00:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2024-11-11 16:00:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4349112426035502) internal successors, (485), 338 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 485 transitions. [2024-11-11 16:00:26,243 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 485 transitions. Word has length 70 [2024-11-11 16:00:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,244 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 485 transitions. [2024-11-11 16:00:26,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 485 transitions. [2024-11-11 16:00:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 16:00:26,246 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,246 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:26,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:00:26,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash 723779029, now seen corresponding path program 1 times [2024-11-11 16:00:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240616820] [2024-11-11 16:00:26,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240616820] [2024-11-11 16:00:26,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240616820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684445214] [2024-11-11 16:00:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,344 INFO L87 Difference]: Start difference. First operand 339 states and 485 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,378 INFO L93 Difference]: Finished difference Result 881 states and 1282 transitions. [2024-11-11 16:00:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 70 [2024-11-11 16:00:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,384 INFO L225 Difference]: With dead ends: 881 [2024-11-11 16:00:26,384 INFO L226 Difference]: Without dead ends: 608 [2024-11-11 16:00:26,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,386 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 134 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 383 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-11 16:00:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-11 16:00:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 1.4332784184514002) internal successors, (870), 607 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 870 transitions. [2024-11-11 16:00:26,410 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 870 transitions. Word has length 70 [2024-11-11 16:00:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,411 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 870 transitions. [2024-11-11 16:00:26,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 870 transitions. [2024-11-11 16:00:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 16:00:26,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,414 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:00:26,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 689513325, now seen corresponding path program 1 times [2024-11-11 16:00:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931469099] [2024-11-11 16:00:26,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931469099] [2024-11-11 16:00:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931469099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785975635] [2024-11-11 16:00:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,564 INFO L87 Difference]: Start difference. First operand 608 states and 870 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,593 INFO L93 Difference]: Finished difference Result 1192 states and 1711 transitions. [2024-11-11 16:00:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 71 [2024-11-11 16:00:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,597 INFO L225 Difference]: With dead ends: 1192 [2024-11-11 16:00:26,597 INFO L226 Difference]: Without dead ends: 650 [2024-11-11 16:00:26,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,599 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-11 16:00:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2024-11-11 16:00:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 1.423728813559322) internal successors, (924), 649 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 924 transitions. [2024-11-11 16:00:26,617 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 924 transitions. Word has length 71 [2024-11-11 16:00:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,617 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 924 transitions. [2024-11-11 16:00:26,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 924 transitions. [2024-11-11 16:00:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 16:00:26,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,620 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:26,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:00:26,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash 942529845, now seen corresponding path program 1 times [2024-11-11 16:00:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154056472] [2024-11-11 16:00:26,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-11 16:00:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154056472] [2024-11-11 16:00:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154056472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353021624] [2024-11-11 16:00:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,689 INFO L87 Difference]: Start difference. First operand 650 states and 924 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,839 INFO L93 Difference]: Finished difference Result 1318 states and 1915 transitions. [2024-11-11 16:00:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 88 [2024-11-11 16:00:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,843 INFO L225 Difference]: With dead ends: 1318 [2024-11-11 16:00:26,843 INFO L226 Difference]: Without dead ends: 734 [2024-11-11 16:00:26,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,846 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 276 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-11-11 16:00:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2024-11-11 16:00:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.4024556616643928) internal successors, (1028), 733 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1028 transitions. [2024-11-11 16:00:26,864 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1028 transitions. Word has length 88 [2024-11-11 16:00:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,865 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1028 transitions. [2024-11-11 16:00:26,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1028 transitions. [2024-11-11 16:00:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 16:00:26,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,867 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:26,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:00:26,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,869 INFO L85 PathProgramCache]: Analyzing trace with hash -242411411, now seen corresponding path program 1 times [2024-11-11 16:00:26,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18399500] [2024-11-11 16:00:26,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-11 16:00:26,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18399500] [2024-11-11 16:00:26,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18399500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242052605] [2024-11-11 16:00:26,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,951 INFO L87 Difference]: Start difference. First operand 734 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,990 INFO L93 Difference]: Finished difference Result 1049 states and 1480 transitions. [2024-11-11 16:00:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 108 [2024-11-11 16:00:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,996 INFO L225 Difference]: With dead ends: 1049 [2024-11-11 16:00:26,996 INFO L226 Difference]: Without dead ends: 1047 [2024-11-11 16:00:26,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,999 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:27,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 325 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-11 16:00:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2024-11-11 16:00:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.4120458891013383) internal successors, (1477), 1046 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1477 transitions. [2024-11-11 16:00:27,024 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1477 transitions. Word has length 108 [2024-11-11 16:00:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:27,025 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1477 transitions. [2024-11-11 16:00:27,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1477 transitions. [2024-11-11 16:00:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 16:00:27,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:27,027 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:27,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:00:27,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:27,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1558450570, now seen corresponding path program 1 times [2024-11-11 16:00:27,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:27,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953335443] [2024-11-11 16:00:27,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:27,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-11 16:00:27,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953335443] [2024-11-11 16:00:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953335443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393612396] [2024-11-11 16:00:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:27,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:27,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:27,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:27,098 INFO L87 Difference]: Start difference. First operand 1047 states and 1477 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:27,294 INFO L93 Difference]: Finished difference Result 2274 states and 3331 transitions. [2024-11-11 16:00:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-11 16:00:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:27,301 INFO L225 Difference]: With dead ends: 2274 [2024-11-11 16:00:27,301 INFO L226 Difference]: Without dead ends: 1287 [2024-11-11 16:00:27,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:27,303 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 51 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:27,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 255 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:00:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-11 16:00:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1287. [2024-11-11 16:00:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1286 states have (on average 1.4517884914463453) internal successors, (1867), 1286 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1867 transitions. [2024-11-11 16:00:27,327 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1867 transitions. Word has length 128 [2024-11-11 16:00:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:27,327 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1867 transitions. [2024-11-11 16:00:27,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1867 transitions. [2024-11-11 16:00:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 16:00:27,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:27,330 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:27,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:00:27,330 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:27,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1052404547, now seen corresponding path program 1 times [2024-11-11 16:00:27,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:27,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763332363] [2024-11-11 16:00:27,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-11 16:00:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763332363] [2024-11-11 16:00:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763332363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:27,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182642036] [2024-11-11 16:00:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:27,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:27,402 INFO L87 Difference]: Start difference. First operand 1287 states and 1867 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:27,578 INFO L93 Difference]: Finished difference Result 2994 states and 4501 transitions. [2024-11-11 16:00:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:27,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 154 [2024-11-11 16:00:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:27,585 INFO L225 Difference]: With dead ends: 2994 [2024-11-11 16:00:27,585 INFO L226 Difference]: Without dead ends: 1671 [2024-11-11 16:00:27,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:27,587 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 47 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:27,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 249 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:00:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-11-11 16:00:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1665. [2024-11-11 16:00:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1664 states have (on average 1.4248798076923077) internal successors, (2371), 1664 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2371 transitions. [2024-11-11 16:00:27,626 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2371 transitions. Word has length 154 [2024-11-11 16:00:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2371 transitions. [2024-11-11 16:00:27,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2371 transitions. [2024-11-11 16:00:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 16:00:27,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:27,630 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:27,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:00:27,630 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:27,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1190457295, now seen corresponding path program 1 times [2024-11-11 16:00:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:27,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315293977] [2024-11-11 16:00:27,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-11 16:00:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315293977] [2024-11-11 16:00:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315293977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:27,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034156297] [2024-11-11 16:00:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:27,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:27,706 INFO L87 Difference]: Start difference. First operand 1665 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:27,878 INFO L93 Difference]: Finished difference Result 3510 states and 5053 transitions. [2024-11-11 16:00:27,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:27,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 175 [2024-11-11 16:00:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:27,886 INFO L225 Difference]: With dead ends: 3510 [2024-11-11 16:00:27,886 INFO L226 Difference]: Without dead ends: 1821 [2024-11-11 16:00:27,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:27,889 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 48 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:27,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 249 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2024-11-11 16:00:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1815. [2024-11-11 16:00:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1814 states have (on average 1.4128996692392504) internal successors, (2563), 1814 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2563 transitions. [2024-11-11 16:00:27,962 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2563 transitions. Word has length 175 [2024-11-11 16:00:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:27,962 INFO L471 AbstractCegarLoop]: Abstraction has 1815 states and 2563 transitions. [2024-11-11 16:00:27,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2563 transitions. [2024-11-11 16:00:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-11 16:00:27,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:27,967 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:27,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:00:27,968 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:27,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash 319775164, now seen corresponding path program 1 times [2024-11-11 16:00:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:27,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032286363] [2024-11-11 16:00:27,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-11 16:00:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032286363] [2024-11-11 16:00:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032286363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:28,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:28,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623270694] [2024-11-11 16:00:28,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:28,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:28,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:28,065 INFO L87 Difference]: Start difference. First operand 1815 states and 2563 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:28,240 INFO L93 Difference]: Finished difference Result 3816 states and 5443 transitions. [2024-11-11 16:00:28,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:28,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2024-11-11 16:00:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:28,247 INFO L225 Difference]: With dead ends: 3816 [2024-11-11 16:00:28,247 INFO L226 Difference]: Without dead ends: 1989 [2024-11-11 16:00:28,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:28,251 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 48 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:28,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 249 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-11-11 16:00:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1983. [2024-11-11 16:00:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1982 states have (on average 1.405146316851665) internal successors, (2785), 1982 states have internal predecessors, (2785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2785 transitions. [2024-11-11 16:00:28,294 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2785 transitions. Word has length 199 [2024-11-11 16:00:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:28,294 INFO L471 AbstractCegarLoop]: Abstraction has 1983 states and 2785 transitions. [2024-11-11 16:00:28,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2785 transitions. [2024-11-11 16:00:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-11 16:00:28,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:28,299 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:28,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:00:28,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:28,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash -172851010, now seen corresponding path program 1 times [2024-11-11 16:00:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481759064] [2024-11-11 16:00:28,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-11 16:00:28,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:28,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481759064] [2024-11-11 16:00:28,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481759064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:28,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969465647] [2024-11-11 16:00:28,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:28,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:28,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:28,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:28,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:28,384 INFO L87 Difference]: Start difference. First operand 1983 states and 2785 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:28,556 INFO L93 Difference]: Finished difference Result 4146 states and 5881 transitions. [2024-11-11 16:00:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:28,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2024-11-11 16:00:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:28,563 INFO L225 Difference]: With dead ends: 4146 [2024-11-11 16:00:28,563 INFO L226 Difference]: Without dead ends: 2175 [2024-11-11 16:00:28,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:28,566 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:28,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 248 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2024-11-11 16:00:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 2169. [2024-11-11 16:00:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4063653136531364) internal successors, (3049), 2168 states have internal predecessors, (3049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3049 transitions. [2024-11-11 16:00:28,635 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3049 transitions. Word has length 199 [2024-11-11 16:00:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:28,635 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3049 transitions. [2024-11-11 16:00:28,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3049 transitions. [2024-11-11 16:00:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-11 16:00:28,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:28,639 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:28,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:00:28,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1351161314, now seen corresponding path program 1 times [2024-11-11 16:00:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068404882] [2024-11-11 16:00:28,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-11 16:00:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068404882] [2024-11-11 16:00:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068404882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:28,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348252277] [2024-11-11 16:00:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:28,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:28,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:28,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:28,744 INFO L87 Difference]: Start difference. First operand 2169 states and 3049 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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-11-11 16:00:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:28,926 INFO L93 Difference]: Finished difference Result 4518 states and 6409 transitions. [2024-11-11 16:00:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:28,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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) Word has length 229 [2024-11-11 16:00:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:28,935 INFO L225 Difference]: With dead ends: 4518 [2024-11-11 16:00:28,935 INFO L226 Difference]: Without dead ends: 2385 [2024-11-11 16:00:28,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:28,939 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 49 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:28,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 245 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:00:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-11-11 16:00:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2379. [2024-11-11 16:00:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2378 states have (on average 1.413372582001682) internal successors, (3361), 2378 states have internal predecessors, (3361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3361 transitions. [2024-11-11 16:00:28,993 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3361 transitions. Word has length 229 [2024-11-11 16:00:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:28,994 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3361 transitions. [2024-11-11 16:00:28,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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-11-11 16:00:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3361 transitions. [2024-11-11 16:00:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-11 16:00:28,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:28,999 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:28,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:00:28,999 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:29,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:29,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2075331091, now seen corresponding path program 1 times [2024-11-11 16:00:29,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:29,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788974127] [2024-11-11 16:00:29,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:29,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-11 16:00:29,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788974127] [2024-11-11 16:00:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788974127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:29,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:29,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24291098] [2024-11-11 16:00:29,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:29,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:29,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:29,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:29,112 INFO L87 Difference]: Start difference. First operand 2379 states and 3361 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:29,302 INFO L93 Difference]: Finished difference Result 4698 states and 6643 transitions. [2024-11-11 16:00:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:29,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2024-11-11 16:00:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:29,310 INFO L225 Difference]: With dead ends: 4698 [2024-11-11 16:00:29,310 INFO L226 Difference]: Without dead ends: 2367 [2024-11-11 16:00:29,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:29,312 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:29,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 241 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:00:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-11 16:00:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2361. [2024-11-11 16:00:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.401271186440678) internal successors, (3307), 2360 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3307 transitions. [2024-11-11 16:00:29,359 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3307 transitions. Word has length 264 [2024-11-11 16:00:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:29,359 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 3307 transitions. [2024-11-11 16:00:29,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3307 transitions. [2024-11-11 16:00:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-11 16:00:29,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:29,364 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:29,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:00:29,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:29,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:29,365 INFO L85 PathProgramCache]: Analyzing trace with hash 111674557, now seen corresponding path program 1 times [2024-11-11 16:00:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725676656] [2024-11-11 16:00:29,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 317 proven. 25 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-11 16:00:29,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725676656] [2024-11-11 16:00:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725676656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363393974] [2024-11-11 16:00:29,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:29,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:29,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:29,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:00:29,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:00:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:29,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:29,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-11 16:00:29,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:29,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363393974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:29,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:00:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 16:00:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578991054] [2024-11-11 16:00:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:29,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:29,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:29,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:00:29,744 INFO L87 Difference]: Start difference. First operand 2361 states and 3307 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:29,943 INFO L93 Difference]: Finished difference Result 4662 states and 6535 transitions. [2024-11-11 16:00:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:29,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 274 [2024-11-11 16:00:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:29,951 INFO L225 Difference]: With dead ends: 4662 [2024-11-11 16:00:29,951 INFO L226 Difference]: Without dead ends: 2367 [2024-11-11 16:00:29,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:00:29,954 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:29,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 273 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:00:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-11 16:00:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2361. [2024-11-11 16:00:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.3783898305084745) internal successors, (3253), 2360 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3253 transitions. [2024-11-11 16:00:30,001 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3253 transitions. Word has length 274 [2024-11-11 16:00:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:30,002 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 3253 transitions. [2024-11-11 16:00:30,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3253 transitions. [2024-11-11 16:00:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-11 16:00:30,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:30,007 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:30,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:00:30,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 16:00:30,208 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1586636999, now seen corresponding path program 1 times [2024-11-11 16:00:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229153311] [2024-11-11 16:00:30,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 384 proven. 25 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2024-11-11 16:00:30,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:30,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229153311] [2024-11-11 16:00:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229153311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:30,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835626629] [2024-11-11 16:00:30,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:30,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:30,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:30,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:00:30,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:00:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:30,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:30,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-11 16:00:30,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:30,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835626629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:30,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:00:30,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 16:00:30,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367383489] [2024-11-11 16:00:30,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:30,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:30,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:00:30,604 INFO L87 Difference]: Start difference. First operand 2361 states and 3253 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:30,803 INFO L93 Difference]: Finished difference Result 4905 states and 6712 transitions. [2024-11-11 16:00:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:30,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 301 [2024-11-11 16:00:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:30,815 INFO L225 Difference]: With dead ends: 4905 [2024-11-11 16:00:30,815 INFO L226 Difference]: Without dead ends: 2610 [2024-11-11 16:00:30,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:00:30,818 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 61 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:30,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 229 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2024-11-11 16:00:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2448. [2024-11-11 16:00:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2447 states have (on average 1.3771965672251736) internal successors, (3370), 2447 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3370 transitions. [2024-11-11 16:00:30,883 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3370 transitions. Word has length 301 [2024-11-11 16:00:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:30,883 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 3370 transitions. [2024-11-11 16:00:30,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3370 transitions. [2024-11-11 16:00:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-11 16:00:30,889 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:30,890 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:30,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 16:00:31,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 16:00:31,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:31,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1643405955, now seen corresponding path program 1 times [2024-11-11 16:00:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838974091] [2024-11-11 16:00:31,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-11 16:00:31,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:31,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838974091] [2024-11-11 16:00:31,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838974091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:31,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:31,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:31,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263345102] [2024-11-11 16:00:31,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:31,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:31,221 INFO L87 Difference]: Start difference. First operand 2448 states and 3370 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:31,373 INFO L93 Difference]: Finished difference Result 4992 states and 6817 transitions. [2024-11-11 16:00:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:31,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 302 [2024-11-11 16:00:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:31,384 INFO L225 Difference]: With dead ends: 4992 [2024-11-11 16:00:31,384 INFO L226 Difference]: Without dead ends: 2358 [2024-11-11 16:00:31,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:31,388 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 39 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:31,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 278 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2024-11-11 16:00:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2349. [2024-11-11 16:00:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 2348 states have (on average 1.372657580919932) internal successors, (3223), 2348 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3223 transitions. [2024-11-11 16:00:31,439 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3223 transitions. Word has length 302 [2024-11-11 16:00:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:31,440 INFO L471 AbstractCegarLoop]: Abstraction has 2349 states and 3223 transitions. [2024-11-11 16:00:31,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3223 transitions. [2024-11-11 16:00:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-11 16:00:31,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:31,446 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:31,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:00:31,446 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:31,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1900515305, now seen corresponding path program 1 times [2024-11-11 16:00:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651823281] [2024-11-11 16:00:31,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-11-11 16:00:31,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651823281] [2024-11-11 16:00:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651823281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90991234] [2024-11-11 16:00:31,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:31,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:31,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:31,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:00:31,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:00:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:31,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:00:31,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-11-11 16:00:31,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-11-11 16:00:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90991234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:32,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:00:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-11 16:00:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629954541] [2024-11-11 16:00:32,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:00:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:00:32,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:00:32,037 INFO L87 Difference]: Start difference. First operand 2349 states and 3223 transitions. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:32,587 INFO L93 Difference]: Finished difference Result 5920 states and 8181 transitions. [2024-11-11 16:00:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:00:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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 312 [2024-11-11 16:00:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:32,598 INFO L225 Difference]: With dead ends: 5920 [2024-11-11 16:00:32,601 INFO L226 Difference]: Without dead ends: 3508 [2024-11-11 16:00:32,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-11 16:00:32,606 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 441 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:32,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1501 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:00:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2024-11-11 16:00:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2349. [2024-11-11 16:00:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 2348 states have (on average 1.3701022146507666) internal successors, (3217), 2348 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3217 transitions. [2024-11-11 16:00:32,671 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3217 transitions. Word has length 312 [2024-11-11 16:00:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:32,671 INFO L471 AbstractCegarLoop]: Abstraction has 2349 states and 3217 transitions. [2024-11-11 16:00:32,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3217 transitions. [2024-11-11 16:00:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-11 16:00:32,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:32,677 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:32,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 16:00:32,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:32,882 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:32,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1632632689, now seen corresponding path program 1 times [2024-11-11 16:00:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907666304] [2024-11-11 16:00:32,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 474 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-11 16:00:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907666304] [2024-11-11 16:00:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907666304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294224156] [2024-11-11 16:00:33,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:33,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:33,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:33,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:00:33,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 16:00:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:33,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:00:33,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-11-11 16:00:33,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-11-11 16:00:33,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294224156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:33,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:00:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-11 16:00:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574742315] [2024-11-11 16:00:33,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:33,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 16:00:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 16:00:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-11 16:00:33,446 INFO L87 Difference]: Start difference. First operand 2349 states and 3217 transitions. Second operand has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:34,321 INFO L93 Difference]: Finished difference Result 5051 states and 7097 transitions. [2024-11-11 16:00:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 16:00:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 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 313 [2024-11-11 16:00:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:34,331 INFO L225 Difference]: With dead ends: 5051 [2024-11-11 16:00:34,331 INFO L226 Difference]: Without dead ends: 2035 [2024-11-11 16:00:34,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-11 16:00:34,338 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 312 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:34,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1595 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:00:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2024-11-11 16:00:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1795. [2024-11-11 16:00:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.3729096989966556) internal successors, (2463), 1794 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2463 transitions. [2024-11-11 16:00:34,369 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2463 transitions. Word has length 313 [2024-11-11 16:00:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:34,370 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2463 transitions. [2024-11-11 16:00:34,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2463 transitions. [2024-11-11 16:00:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-11 16:00:34,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:34,375 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:34,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 16:00:34,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:34,579 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:34,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash -570287145, now seen corresponding path program 1 times [2024-11-11 16:00:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:34,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001824464] [2024-11-11 16:00:34,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:34,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 472 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-11 16:00:34,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:34,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001824464] [2024-11-11 16:00:34,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001824464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:34,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284941889] [2024-11-11 16:00:34,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:34,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:34,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:34,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:00:34,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 16:00:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:34,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:00:34,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2024-11-11 16:00:35,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284941889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:35,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:00:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-11 16:00:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235037666] [2024-11-11 16:00:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:00:35,193 INFO L87 Difference]: Start difference. First operand 1795 states and 2463 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:35,210 INFO L93 Difference]: Finished difference Result 1800 states and 2467 transitions. [2024-11-11 16:00:35,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:35,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 314 [2024-11-11 16:00:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:35,215 INFO L225 Difference]: With dead ends: 1800 [2024-11-11 16:00:35,215 INFO L226 Difference]: Without dead ends: 1168 [2024-11-11 16:00:35,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:00:35,217 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 54 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:35,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-11-11 16:00:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2024-11-11 16:00:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1165 states have (on average 1.3639484978540772) internal successors, (1589), 1165 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1589 transitions. [2024-11-11 16:00:35,237 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1589 transitions. Word has length 314 [2024-11-11 16:00:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:35,237 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1589 transitions. [2024-11-11 16:00:35,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1589 transitions. [2024-11-11 16:00:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-11 16:00:35,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:35,242 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:35,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 16:00:35,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-11 16:00:35,443 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:35,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1838990621, now seen corresponding path program 1 times [2024-11-11 16:00:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:35,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298244848] [2024-11-11 16:00:35,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:35,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-11 16:00:35,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:35,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298244848] [2024-11-11 16:00:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298244848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444946105] [2024-11-11 16:00:35,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:35,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:35,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:35,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:00:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 16:00:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:35,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:00:35,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-11 16:00:35,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-11 16:00:35,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444946105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:35,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:00:35,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-11 16:00:35,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308734488] [2024-11-11 16:00:35,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:35,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:00:35,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:35,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:00:35,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:00:35,924 INFO L87 Difference]: Start difference. First operand 1166 states and 1589 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:36,386 INFO L93 Difference]: Finished difference Result 2997 states and 4146 transitions. [2024-11-11 16:00:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:00:36,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2024-11-11 16:00:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:36,391 INFO L225 Difference]: With dead ends: 2997 [2024-11-11 16:00:36,391 INFO L226 Difference]: Without dead ends: 1784 [2024-11-11 16:00:36,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:00:36,393 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 191 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:36,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 902 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:00:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2024-11-11 16:00:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1325. [2024-11-11 16:00:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.3768882175226587) internal successors, (1823), 1324 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1823 transitions. [2024-11-11 16:00:36,419 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1823 transitions. Word has length 316 [2024-11-11 16:00:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:36,419 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1823 transitions. [2024-11-11 16:00:36,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1823 transitions. [2024-11-11 16:00:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-11 16:00:36,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:36,422 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:36,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 16:00:36,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:36,624 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash -352168918, now seen corresponding path program 1 times [2024-11-11 16:00:36,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:36,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231216755] [2024-11-11 16:00:36,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-11 16:00:36,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:36,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231216755] [2024-11-11 16:00:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231216755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033773736] [2024-11-11 16:00:36,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:36,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:36,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:36,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:00:36,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 16:00:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:36,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:00:36,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-11 16:00:36,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-11 16:00:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033773736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:37,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:00:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-11 16:00:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189317993] [2024-11-11 16:00:37,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:37,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:00:37,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:37,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:00:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:00:37,058 INFO L87 Difference]: Start difference. First operand 1325 states and 1823 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:37,296 INFO L93 Difference]: Finished difference Result 1900 states and 2582 transitions. [2024-11-11 16:00:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 16:00:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2024-11-11 16:00:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:37,300 INFO L225 Difference]: With dead ends: 1900 [2024-11-11 16:00:37,300 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:00:37,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:00:37,302 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 64 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:37,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 574 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:00:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:00:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:00:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:00:37,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 342 [2024-11-11 16:00:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:37,304 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:00:37,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:00:37,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:00:37,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:00:37,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 16:00:37,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:37,511 INFO L421 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] [2024-11-11 16:00:37,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:00:39,307 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:00:39,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:00:39 BoogieIcfgContainer [2024-11-11 16:00:39,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:00:39,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:00:39,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:00:39,328 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:00:39,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:24" (3/4) ... [2024-11-11 16:00:39,331 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:00:39,346 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-11 16:00:39,347 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:00:39,347 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:00:39,348 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:00:39,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:00:39,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:00:39,491 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:00:39,491 INFO L158 Benchmark]: Toolchain (without parser) took 16180.92ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 123.1MB in the beginning and 154.1MB in the end (delta: -31.1MB). Peak memory consumption was 157.8MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,492 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 64.4MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:00:39,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.07ms. Allocated memory is still 174.1MB. Free memory was 123.1MB in the beginning and 105.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.17ms. Allocated memory is still 174.1MB. Free memory was 105.7MB in the beginning and 102.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,493 INFO L158 Benchmark]: Boogie Preprocessor took 67.10ms. Allocated memory is still 174.1MB. Free memory was 102.7MB in the beginning and 99.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,493 INFO L158 Benchmark]: RCFGBuilder took 816.20ms. Allocated memory is still 174.1MB. Free memory was 99.4MB in the beginning and 109.9MB in the end (delta: -10.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,493 INFO L158 Benchmark]: TraceAbstraction took 14660.82ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 108.7MB in the beginning and 163.6MB in the end (delta: -54.9MB). Peak memory consumption was 189.6MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,494 INFO L158 Benchmark]: Witness Printer took 162.72ms. Allocated memory is still 362.8MB. Free memory was 163.6MB in the beginning and 154.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,495 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.16ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 64.4MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.07ms. Allocated memory is still 174.1MB. Free memory was 123.1MB in the beginning and 105.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.17ms. Allocated memory is still 174.1MB. Free memory was 105.7MB in the beginning and 102.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.10ms. Allocated memory is still 174.1MB. Free memory was 102.7MB in the beginning and 99.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 816.20ms. Allocated memory is still 174.1MB. Free memory was 99.4MB in the beginning and 109.9MB in the end (delta: -10.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14660.82ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 108.7MB in the beginning and 163.6MB in the end (delta: -54.9MB). Peak memory consumption was 189.6MB. Max. memory is 16.1GB. * Witness Printer took 162.72ms. Allocated memory is still 362.8MB. Free memory was 163.6MB in the beginning and 154.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. 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: 624]: 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, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 24, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2021 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2021 mSDsluCounter, 10150 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5457 mSDsCounter, 400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4874 IncrementalHoareTripleChecker+Invalid, 5274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 400 mSolverCounterUnsat, 4693 mSDtfsCounter, 4874 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3549 GetRequests, 3482 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2448occurred in iteration=18, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 2075 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 6565 NumberOfCodeBlocks, 6565 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 7813 ConstructedInterpolants, 0 QuantifiedInterpolants, 10507 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3966 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 23872/24122 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: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((ag_Y <= 208) && (s__state <= 208)) && (s__hit != 0)) || ((((4368 == s__state) && (ag_Y <= 208)) && (s__hit != 0)) && (blastFlag == 0))) || ((2 == blastFlag) && (48 == ag_Z))) || (((s__hit != 0) && (4416 == s__state)) && (blastFlag <= 4))) || ((((s__hit == 0) && (48 == ag_Z)) && (12292 == s__state)) && (blastFlag == 0))) || (((4384 == s__state) && (blastFlag == 1)) && (s__hit != 0))) || (((48 == ag_Z) && (4416 == s__state)) && (blastFlag <= 4))) || ((((4432 <= s__state) && (48 == ag_Z)) && (s__state <= 4528)) && (blastFlag <= 4))) || (((((s__hit == 0) && (48 == ag_Z)) && (4560 == s__s3__tmp__next_state___0)) && (4560 == s__state)) && (blastFlag <= 4))) || ((((ag_Y <= 208) && (s__hit != 0)) && (12292 == s__state)) && (blastFlag == 0))) || (((4384 == s__state) && (blastFlag == 1)) && (48 == ag_Z))) || (((4352 == s__state) && (3 == s__s3__tmp__next_state___0)) && (s__hit != 0))) || ((((4432 <= s__state) && (s__hit != 0)) && (s__state <= 4528)) && (blastFlag <= 4))) || ((48 == ag_Z) && (48 == s__state))) || ((((s__hit == 0) && (4368 == s__state)) && (48 == ag_Z)) && (blastFlag == 0))) || (((((4352 == s__state) && (s__hit == 0)) && (48 == ag_Z)) && (4560 == s__s3__tmp__next_state___0)) && (blastFlag <= 4))) || (3 == s__state)) || ((2 == blastFlag) && (s__hit != 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:00:39,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE