./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:29:25,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:29:25,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:29:25,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:29:25,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:29:25,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:29:25,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:29:25,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:29:25,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:29:25,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:29:25,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:29:25,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:29:25,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:29:25,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:29:25,830 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:29:25,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:29:25,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:29:25,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:29:25,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:29:25,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:29:25,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:29:25,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:29:25,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:29:25,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:29:25,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:29:25,837 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:29:25,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:29:25,837 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:29:25,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:29:25,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:29:25,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:29:25,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:29:25,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:25,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:29:25,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:29:25,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:29:25,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:29:25,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:29:25,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:29:25,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:29:25,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:29:25,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:29:25,844 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2024-10-10 22:29:26,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:29:26,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:29:26,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:29:26,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:29:26,061 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:29:26,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-10-10 22:29:27,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:29:27,539 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:29:27,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-10-10 22:29:27,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4fb29f114/f0969860d7cc4114bdf71282e7fc8c08/FLAG6543eb153 [2024-10-10 22:29:27,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4fb29f114/f0969860d7cc4114bdf71282e7fc8c08 [2024-10-10 22:29:27,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:29:27,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:29:27,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:27,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:29:27,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:29:27,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:27" (1/1) ... [2024-10-10 22:29:27,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cce7ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:27, skipping insertion in model container [2024-10-10 22:29:27,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:27" (1/1) ... [2024-10-10 22:29:27,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:29:28,143 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2024-10-10 22:29:28,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:28,162 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:29:28,199 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2024-10-10 22:29:28,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:28,213 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:29:28,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28 WrapperNode [2024-10-10 22:29:28,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:28,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:28,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:29:28,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:29:28,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,257 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 529 [2024-10-10 22:29:28,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:28,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:29:28,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:29:28,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:29:28,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,295 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:29:28,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:29:28,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:29:28,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:29:28,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:29:28,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (1/1) ... [2024-10-10 22:29:28,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:28,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:28,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:29:28,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:29:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:29:28,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:29:28,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:29:28,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:29:28,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:29:28,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:29:28,575 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:29:28,938 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-10-10 22:29:28,939 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-10-10 22:29:28,983 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 22:29:28,983 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:29:29,015 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:29:29,015 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:29:29,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:29 BoogieIcfgContainer [2024-10-10 22:29:29,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:29:29,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:29:29,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:29:29,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:29:29,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:29:27" (1/3) ... [2024-10-10 22:29:29,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3038a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:29, skipping insertion in model container [2024-10-10 22:29:29,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:28" (2/3) ... [2024-10-10 22:29:29,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3038a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:29, skipping insertion in model container [2024-10-10 22:29:29,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:29" (3/3) ... [2024-10-10 22:29:29,023 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2024-10-10 22:29:29,035 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:29:29,036 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:29:29,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:29:29,106 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;@29199b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:29:29,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:29:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 125 states have (on average 1.76) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:29:29,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:29,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:29,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1091064671, now seen corresponding path program 1 times [2024-10-10 22:29:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:29,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475634193] [2024-10-10 22:29:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:29:29,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475634193] [2024-10-10 22:29:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475634193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:29,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:29:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66820892] [2024-10-10 22:29:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:29,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:29,395 INFO L87 Difference]: Start difference. First operand has 127 states, 125 states have (on average 1.76) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:29,566 INFO L93 Difference]: Finished difference Result 249 states and 433 transitions. [2024-10-10 22:29:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:29,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-10 22:29:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:29,580 INFO L225 Difference]: With dead ends: 249 [2024-10-10 22:29:29,581 INFO L226 Difference]: Without dead ends: 117 [2024-10-10 22:29:29,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:29,588 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:29,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 319 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-10 22:29:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-10 22:29:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.543103448275862) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2024-10-10 22:29:29,622 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 23 [2024-10-10 22:29:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:29,623 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2024-10-10 22:29:29,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2024-10-10 22:29:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 22:29:29,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:29,627 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:29:29,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:29:29,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:29,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1983510372, now seen corresponding path program 1 times [2024-10-10 22:29:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:29,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001086034] [2024-10-10 22:29:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:29:29,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:29,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001086034] [2024-10-10 22:29:29,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001086034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:29,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:29,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:29,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035088399] [2024-10-10 22:29:29,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:29,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:29,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:29,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:29,704 INFO L87 Difference]: Start difference. First operand 117 states and 179 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:29,991 INFO L93 Difference]: Finished difference Result 239 states and 369 transitions. [2024-10-10 22:29:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-10 22:29:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:29,992 INFO L225 Difference]: With dead ends: 239 [2024-10-10 22:29:29,993 INFO L226 Difference]: Without dead ends: 131 [2024-10-10 22:29:29,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:29,994 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:29,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 248 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-10 22:29:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-10 22:29:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.523076923076923) internal successors, (198), 130 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-10-10 22:29:30,001 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 33 [2024-10-10 22:29:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:30,002 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-10-10 22:29:30,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-10-10 22:29:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:29:30,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:30,003 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:29:30,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2051034107, now seen corresponding path program 1 times [2024-10-10 22:29:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093450250] [2024-10-10 22:29:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:29:30,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093450250] [2024-10-10 22:29:30,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093450250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:30,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:30,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:29:30,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675994158] [2024-10-10 22:29:30,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:30,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:30,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:30,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:30,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,106 INFO L87 Difference]: Start difference. First operand 131 states and 198 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:30,159 INFO L93 Difference]: Finished difference Result 277 states and 414 transitions. [2024-10-10 22:29:30,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:30,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-10 22:29:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:30,161 INFO L225 Difference]: With dead ends: 277 [2024-10-10 22:29:30,161 INFO L226 Difference]: Without dead ends: 155 [2024-10-10 22:29:30,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,162 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 21 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:30,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 324 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-10 22:29:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-10 22:29:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4870129870129871) internal successors, (229), 154 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-10-10 22:29:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2024-10-10 22:29:30,172 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 46 [2024-10-10 22:29:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:30,172 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2024-10-10 22:29:30,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2024-10-10 22:29:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:29:30,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:30,174 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:30,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:29:30,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:30,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash -438494855, now seen corresponding path program 1 times [2024-10-10 22:29:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937228850] [2024-10-10 22:29:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:29:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937228850] [2024-10-10 22:29:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937228850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:30,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:30,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297938046] [2024-10-10 22:29:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:30,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:30,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:30,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,219 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:30,317 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2024-10-10 22:29:30,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:30,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-10 22:29:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:30,319 INFO L225 Difference]: With dead ends: 293 [2024-10-10 22:29:30,319 INFO L226 Difference]: Without dead ends: 171 [2024-10-10 22:29:30,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,320 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:30,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 261 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-10 22:29:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-10 22:29:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 170 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 250 transitions. [2024-10-10 22:29:30,327 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 250 transitions. Word has length 46 [2024-10-10 22:29:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:30,328 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 250 transitions. [2024-10-10 22:29:30,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2024-10-10 22:29:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-10 22:29:30,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:30,329 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:30,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:29:30,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:30,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1782095985, now seen corresponding path program 1 times [2024-10-10 22:29:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:30,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535334728] [2024-10-10 22:29:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:30,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:29:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535334728] [2024-10-10 22:29:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535334728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:30,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194272072] [2024-10-10 22:29:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:30,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,375 INFO L87 Difference]: Start difference. First operand 171 states and 250 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:30,397 INFO L93 Difference]: Finished difference Result 464 states and 679 transitions. [2024-10-10 22:29:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:30,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 64 [2024-10-10 22:29:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:30,399 INFO L225 Difference]: With dead ends: 464 [2024-10-10 22:29:30,399 INFO L226 Difference]: Without dead ends: 326 [2024-10-10 22:29:30,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,401 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:30,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 330 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-10 22:29:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-10-10 22:29:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4551083591331269) internal successors, (470), 323 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 470 transitions. [2024-10-10 22:29:30,420 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 470 transitions. Word has length 64 [2024-10-10 22:29:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:30,421 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 470 transitions. [2024-10-10 22:29:30,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 470 transitions. [2024-10-10 22:29:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-10 22:29:30,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:30,428 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:30,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:29:30,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:30,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1762519458, now seen corresponding path program 1 times [2024-10-10 22:29:30,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:30,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892772622] [2024-10-10 22:29:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:30,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:29:30,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892772622] [2024-10-10 22:29:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892772622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:30,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:30,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593511452] [2024-10-10 22:29:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:30,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:30,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,519 INFO L87 Difference]: Start difference. First operand 324 states and 470 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:30,558 INFO L93 Difference]: Finished difference Result 850 states and 1251 transitions. [2024-10-10 22:29:30,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:30,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 64 [2024-10-10 22:29:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:30,560 INFO L225 Difference]: With dead ends: 850 [2024-10-10 22:29:30,560 INFO L226 Difference]: Without dead ends: 585 [2024-10-10 22:29:30,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,562 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 133 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:30,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 368 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-10 22:29:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2024-10-10 22:29:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4503424657534247) internal successors, (847), 584 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 847 transitions. [2024-10-10 22:29:30,584 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 847 transitions. Word has length 64 [2024-10-10 22:29:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:30,584 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 847 transitions. [2024-10-10 22:29:30,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 847 transitions. [2024-10-10 22:29:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-10 22:29:30,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:30,587 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:30,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:29:30,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:30,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1557452356, now seen corresponding path program 1 times [2024-10-10 22:29:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150895585] [2024-10-10 22:29:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:29:30,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150895585] [2024-10-10 22:29:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150895585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:30,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:30,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633625899] [2024-10-10 22:29:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:30,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,646 INFO L87 Difference]: Start difference. First operand 585 states and 847 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:30,676 INFO L93 Difference]: Finished difference Result 1151 states and 1670 transitions. [2024-10-10 22:29:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:30,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 65 [2024-10-10 22:29:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:30,679 INFO L225 Difference]: With dead ends: 1151 [2024-10-10 22:29:30,679 INFO L226 Difference]: Without dead ends: 625 [2024-10-10 22:29:30,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,681 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 11 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:30,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-10-10 22:29:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2024-10-10 22:29:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.4407051282051282) internal successors, (899), 624 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 899 transitions. [2024-10-10 22:29:30,728 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 899 transitions. Word has length 65 [2024-10-10 22:29:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:30,728 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 899 transitions. [2024-10-10 22:29:30,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 899 transitions. [2024-10-10 22:29:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-10 22:29:30,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:30,731 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:30,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:29:30,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:30,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash -991205824, now seen corresponding path program 1 times [2024-10-10 22:29:30,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:30,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247449392] [2024-10-10 22:29:30,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-10 22:29:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:30,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247449392] [2024-10-10 22:29:30,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247449392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:30,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:30,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384527651] [2024-10-10 22:29:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,781 INFO L87 Difference]: Start difference. First operand 625 states and 899 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:30,891 INFO L93 Difference]: Finished difference Result 1271 states and 1868 transitions. [2024-10-10 22:29:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 81 [2024-10-10 22:29:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:30,894 INFO L225 Difference]: With dead ends: 1271 [2024-10-10 22:29:30,894 INFO L226 Difference]: Without dead ends: 705 [2024-10-10 22:29:30,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,896 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:30,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 266 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-10 22:29:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-10-10 22:29:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.4190340909090908) internal successors, (999), 704 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 999 transitions. [2024-10-10 22:29:30,907 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 999 transitions. Word has length 81 [2024-10-10 22:29:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:30,908 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 999 transitions. [2024-10-10 22:29:30,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 999 transitions. [2024-10-10 22:29:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-10 22:29:30,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:30,909 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:30,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:29:30,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:30,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1607137658, now seen corresponding path program 1 times [2024-10-10 22:29:30,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:30,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914914656] [2024-10-10 22:29:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:30,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 22:29:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914914656] [2024-10-10 22:29:30,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914914656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:30,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:30,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:30,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939198891] [2024-10-10 22:29:30,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:30,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:30,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:30,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:30,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,957 INFO L87 Difference]: Start difference. First operand 705 states and 999 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-10-10 22:29:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:30,988 INFO L93 Difference]: Finished difference Result 1010 states and 1441 transitions. [2024-10-10 22:29:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:30,989 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 100 [2024-10-10 22:29:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:30,992 INFO L225 Difference]: With dead ends: 1010 [2024-10-10 22:29:30,992 INFO L226 Difference]: Without dead ends: 1008 [2024-10-10 22:29:30,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:30,993 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 149 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:30,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 314 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-10-10 22:29:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2024-10-10 22:29:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 1.4280039721946376) internal successors, (1438), 1007 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1438 transitions. [2024-10-10 22:29:31,010 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1438 transitions. Word has length 100 [2024-10-10 22:29:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:31,010 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1438 transitions. [2024-10-10 22:29:31,010 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-10-10 22:29:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1438 transitions. [2024-10-10 22:29:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-10 22:29:31,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:31,012 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:31,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:29:31,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:31,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 438435727, now seen corresponding path program 1 times [2024-10-10 22:29:31,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:31,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959954889] [2024-10-10 22:29:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:31,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 22:29:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959954889] [2024-10-10 22:29:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959954889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969841707] [2024-10-10 22:29:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:31,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:31,061 INFO L87 Difference]: Start difference. First operand 1008 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:31,216 INFO L93 Difference]: Finished difference Result 2197 states and 3254 transitions. [2024-10-10 22:29:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 119 [2024-10-10 22:29:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:31,223 INFO L225 Difference]: With dead ends: 2197 [2024-10-10 22:29:31,223 INFO L226 Difference]: Without dead ends: 1242 [2024-10-10 22:29:31,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:31,225 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:31,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 248 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2024-10-10 22:29:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2024-10-10 22:29:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 1.468170829975826) internal successors, (1822), 1241 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1822 transitions. [2024-10-10 22:29:31,267 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1822 transitions. Word has length 119 [2024-10-10 22:29:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1822 transitions. [2024-10-10 22:29:31,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1822 transitions. [2024-10-10 22:29:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-10 22:29:31,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:31,271 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:31,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:29:31,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 126510689, now seen corresponding path program 1 times [2024-10-10 22:29:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154007418] [2024-10-10 22:29:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-10 22:29:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:31,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154007418] [2024-10-10 22:29:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154007418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:31,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937478697] [2024-10-10 22:29:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:31,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:31,341 INFO L87 Difference]: Start difference. First operand 1242 states and 1822 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-10-10 22:29:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:31,488 INFO L93 Difference]: Finished difference Result 2899 states and 4406 transitions. [2024-10-10 22:29:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:31,489 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 142 [2024-10-10 22:29:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:31,494 INFO L225 Difference]: With dead ends: 2899 [2024-10-10 22:29:31,494 INFO L226 Difference]: Without dead ends: 1614 [2024-10-10 22:29:31,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:31,497 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:31,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 239 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-10 22:29:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1608. [2024-10-10 22:29:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.4399502177971375) internal successors, (2314), 1607 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2314 transitions. [2024-10-10 22:29:31,533 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2314 transitions. Word has length 142 [2024-10-10 22:29:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:31,534 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2314 transitions. [2024-10-10 22:29:31,534 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-10-10 22:29:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2314 transitions. [2024-10-10 22:29:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-10 22:29:31,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:31,539 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:31,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:29:31,539 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:31,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2147459693, now seen corresponding path program 1 times [2024-10-10 22:29:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:31,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363709511] [2024-10-10 22:29:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:31,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-10 22:29:31,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363709511] [2024-10-10 22:29:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363709511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:31,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:31,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:31,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292253704] [2024-10-10 22:29:31,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:31,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:31,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:31,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:31,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:31,606 INFO L87 Difference]: Start difference. First operand 1608 states and 2314 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-10-10 22:29:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:31,749 INFO L93 Difference]: Finished difference Result 3397 states and 4940 transitions. [2024-10-10 22:29:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:31,750 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 162 [2024-10-10 22:29:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:31,754 INFO L225 Difference]: With dead ends: 3397 [2024-10-10 22:29:31,754 INFO L226 Difference]: Without dead ends: 1758 [2024-10-10 22:29:31,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:31,756 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 48 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:31,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 239 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-10-10 22:29:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1752. [2024-10-10 22:29:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 1.4277555682467162) internal successors, (2500), 1751 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2500 transitions. [2024-10-10 22:29:31,783 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2500 transitions. Word has length 162 [2024-10-10 22:29:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:31,784 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2500 transitions. [2024-10-10 22:29:31,784 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-10-10 22:29:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2500 transitions. [2024-10-10 22:29:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-10 22:29:31,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:31,786 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:31,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:29:31,786 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:31,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:31,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2018596588, now seen corresponding path program 1 times [2024-10-10 22:29:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:31,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969789876] [2024-10-10 22:29:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-10-10 22:29:31,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:31,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969789876] [2024-10-10 22:29:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969789876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:31,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:31,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093207701] [2024-10-10 22:29:31,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:31,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:31,841 INFO L87 Difference]: Start difference. First operand 1752 states and 2500 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:32,006 INFO L93 Difference]: Finished difference Result 3691 states and 5318 transitions. [2024-10-10 22:29:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:32,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 185 [2024-10-10 22:29:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:32,012 INFO L225 Difference]: With dead ends: 3691 [2024-10-10 22:29:32,012 INFO L226 Difference]: Without dead ends: 1920 [2024-10-10 22:29:32,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:32,014 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 48 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:32,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 239 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2024-10-10 22:29:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1914. [2024-10-10 22:29:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.4197595399895453) internal successors, (2716), 1913 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2716 transitions. [2024-10-10 22:29:32,045 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2716 transitions. Word has length 185 [2024-10-10 22:29:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:32,046 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2716 transitions. [2024-10-10 22:29:32,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2716 transitions. [2024-10-10 22:29:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-10 22:29:32,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:32,049 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:32,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:29:32,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:32,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2072989486, now seen corresponding path program 1 times [2024-10-10 22:29:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:32,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621826778] [2024-10-10 22:29:32,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:32,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-10-10 22:29:32,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:32,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621826778] [2024-10-10 22:29:32,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621826778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:32,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:32,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:32,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077063833] [2024-10-10 22:29:32,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:32,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:32,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:32,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:32,104 INFO L87 Difference]: Start difference. First operand 1914 states and 2716 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:32,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:32,269 INFO L93 Difference]: Finished difference Result 4009 states and 5744 transitions. [2024-10-10 22:29:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:32,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 185 [2024-10-10 22:29:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:32,283 INFO L225 Difference]: With dead ends: 4009 [2024-10-10 22:29:32,283 INFO L226 Difference]: Without dead ends: 2100 [2024-10-10 22:29:32,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:32,295 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 48 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:32,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 238 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-10-10 22:29:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2094. [2024-10-10 22:29:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 2093 states have (on average 1.4209268991877688) internal successors, (2974), 2093 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2974 transitions. [2024-10-10 22:29:32,379 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2974 transitions. Word has length 185 [2024-10-10 22:29:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:32,379 INFO L471 AbstractCegarLoop]: Abstraction has 2094 states and 2974 transitions. [2024-10-10 22:29:32,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2974 transitions. [2024-10-10 22:29:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-10 22:29:32,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:32,390 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:32,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:29:32,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:32,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash 457007458, now seen corresponding path program 1 times [2024-10-10 22:29:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:32,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628755171] [2024-10-10 22:29:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-10-10 22:29:32,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:32,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628755171] [2024-10-10 22:29:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628755171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:32,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:32,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:32,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618918580] [2024-10-10 22:29:32,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:32,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:32,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:32,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:32,547 INFO L87 Difference]: Start difference. First operand 2094 states and 2974 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:32,752 INFO L93 Difference]: Finished difference Result 4369 states and 6260 transitions. [2024-10-10 22:29:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:32,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 214 [2024-10-10 22:29:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:32,765 INFO L225 Difference]: With dead ends: 4369 [2024-10-10 22:29:32,765 INFO L226 Difference]: Without dead ends: 2304 [2024-10-10 22:29:32,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:32,777 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:32,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 235 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-10-10 22:29:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2298. [2024-10-10 22:29:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2298 states, 2297 states have (on average 1.4279494993469743) internal successors, (3280), 2297 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 3280 transitions. [2024-10-10 22:29:32,911 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 3280 transitions. Word has length 214 [2024-10-10 22:29:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:32,911 INFO L471 AbstractCegarLoop]: Abstraction has 2298 states and 3280 transitions. [2024-10-10 22:29:32,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 3280 transitions. [2024-10-10 22:29:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-10 22:29:32,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:32,916 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:32,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:29:32,916 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:32,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1369202223, now seen corresponding path program 1 times [2024-10-10 22:29:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:32,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788526060] [2024-10-10 22:29:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2024-10-10 22:29:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788526060] [2024-10-10 22:29:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788526060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:32,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:32,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:32,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398330357] [2024-10-10 22:29:32,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:32,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:32,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:32,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:32,983 INFO L87 Difference]: Start difference. First operand 2298 states and 3280 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:33,132 INFO L93 Difference]: Finished difference Result 4543 states and 6488 transitions. [2024-10-10 22:29:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:33,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 248 [2024-10-10 22:29:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:33,139 INFO L225 Difference]: With dead ends: 4543 [2024-10-10 22:29:33,139 INFO L226 Difference]: Without dead ends: 2286 [2024-10-10 22:29:33,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:33,143 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 51 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:33,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 231 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2024-10-10 22:29:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2280. [2024-10-10 22:29:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2279 states have (on average 1.4155331285651602) internal successors, (3226), 2279 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3226 transitions. [2024-10-10 22:29:33,183 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3226 transitions. Word has length 248 [2024-10-10 22:29:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:33,184 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3226 transitions. [2024-10-10 22:29:33,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3226 transitions. [2024-10-10 22:29:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-10 22:29:33,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:33,188 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:33,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:29:33,188 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:33,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1133924132, now seen corresponding path program 1 times [2024-10-10 22:29:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785157509] [2024-10-10 22:29:33,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:33,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 285 proven. 22 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-10-10 22:29:33,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785157509] [2024-10-10 22:29:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785157509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038503460] [2024-10-10 22:29:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:33,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:33,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:33,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:33,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:29:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:33,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:29:33,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 22:29:33,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038503460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 22:29:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107182529] [2024-10-10 22:29:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:33,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:33,605 INFO L87 Difference]: Start difference. First operand 2280 states and 3226 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-10-10 22:29:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:33,759 INFO L93 Difference]: Finished difference Result 4507 states and 6380 transitions. [2024-10-10 22:29:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:33,760 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 260 [2024-10-10 22:29:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:33,767 INFO L225 Difference]: With dead ends: 4507 [2024-10-10 22:29:33,768 INFO L226 Difference]: Without dead ends: 2286 [2024-10-10 22:29:33,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 260 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-10-10 22:29:33,771 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:33,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 263 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2024-10-10 22:29:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2280. [2024-10-10 22:29:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2279 states have (on average 1.3918385256691532) internal successors, (3172), 2279 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3172 transitions. [2024-10-10 22:29:33,816 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3172 transitions. Word has length 260 [2024-10-10 22:29:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:33,817 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3172 transitions. [2024-10-10 22:29:33,817 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-10-10 22:29:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3172 transitions. [2024-10-10 22:29:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-10 22:29:33,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:33,822 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:33,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:29:34,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 22:29:34,024 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:34,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash 182966378, now seen corresponding path program 1 times [2024-10-10 22:29:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:34,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064941285] [2024-10-10 22:29:34,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 344 proven. 22 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2024-10-10 22:29:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064941285] [2024-10-10 22:29:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064941285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956648307] [2024-10-10 22:29:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:34,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:34,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:34,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:29:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:34,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:29:34,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-10-10 22:29:34,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956648307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:34,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:34,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 22:29:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968541113] [2024-10-10 22:29:34,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:34,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:34,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:34,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:34,392 INFO L87 Difference]: Start difference. First operand 2280 states and 3172 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:34,560 INFO L93 Difference]: Finished difference Result 4744 states and 6551 transitions. [2024-10-10 22:29:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:34,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 285 [2024-10-10 22:29:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:34,569 INFO L225 Difference]: With dead ends: 4744 [2024-10-10 22:29:34,569 INFO L226 Difference]: Without dead ends: 2523 [2024-10-10 22:29:34,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 285 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-10-10 22:29:34,602 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 61 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:34,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 222 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2024-10-10 22:29:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2361. [2024-10-10 22:29:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.3911016949152541) internal successors, (3283), 2360 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3283 transitions. [2024-10-10 22:29:34,670 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3283 transitions. Word has length 285 [2024-10-10 22:29:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:34,671 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 3283 transitions. [2024-10-10 22:29:34,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3283 transitions. [2024-10-10 22:29:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-10 22:29:34,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:34,678 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:34,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:29:34,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:29:34,879 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:34,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:34,880 INFO L85 PathProgramCache]: Analyzing trace with hash 125937572, now seen corresponding path program 1 times [2024-10-10 22:29:34,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:34,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436435588] [2024-10-10 22:29:34,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:34,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-10-10 22:29:35,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:35,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436435588] [2024-10-10 22:29:35,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436435588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:35,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:35,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149762153] [2024-10-10 22:29:35,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:35,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:35,026 INFO L87 Difference]: Start difference. First operand 2361 states and 3283 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:35,171 INFO L93 Difference]: Finished difference Result 4825 states and 6650 transitions. [2024-10-10 22:29:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2024-10-10 22:29:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:35,179 INFO L225 Difference]: With dead ends: 4825 [2024-10-10 22:29:35,179 INFO L226 Difference]: Without dead ends: 2277 [2024-10-10 22:29:35,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:35,184 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:35,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 268 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2024-10-10 22:29:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2268. [2024-10-10 22:29:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 2267 states have (on average 1.3859726510807233) internal successors, (3142), 2267 states have internal predecessors, (3142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3142 transitions. [2024-10-10 22:29:35,238 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3142 transitions. Word has length 286 [2024-10-10 22:29:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:35,239 INFO L471 AbstractCegarLoop]: Abstraction has 2268 states and 3142 transitions. [2024-10-10 22:29:35,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3142 transitions. [2024-10-10 22:29:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-10 22:29:35,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:35,245 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:35,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:29:35,246 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:35,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2133389154, now seen corresponding path program 1 times [2024-10-10 22:29:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998774720] [2024-10-10 22:29:35,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:35,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-10 22:29:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998774720] [2024-10-10 22:29:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998774720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890413843] [2024-10-10 22:29:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:35,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:35,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:35,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:35,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:29:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:35,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:29:35,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-10 22:29:35,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-10 22:29:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890413843] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:35,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:35,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-10 22:29:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727002968] [2024-10-10 22:29:35,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:35,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:29:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:29:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:29:35,692 INFO L87 Difference]: Start difference. First operand 2268 states and 3142 transitions. Second operand has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:36,047 INFO L93 Difference]: Finished difference Result 5725 states and 7986 transitions. [2024-10-10 22:29:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:29:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 0 states have call successors, (0), 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 297 [2024-10-10 22:29:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:36,063 INFO L225 Difference]: With dead ends: 5725 [2024-10-10 22:29:36,065 INFO L226 Difference]: Without dead ends: 3390 [2024-10-10 22:29:36,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 588 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-10-10 22:29:36,068 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 463 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:36,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1039 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:29:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2024-10-10 22:29:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 2268. [2024-10-10 22:29:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 2267 states have (on average 1.3833259814733128) internal successors, (3136), 2267 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3136 transitions. [2024-10-10 22:29:36,108 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3136 transitions. Word has length 297 [2024-10-10 22:29:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:36,109 INFO L471 AbstractCegarLoop]: Abstraction has 2268 states and 3136 transitions. [2024-10-10 22:29:36,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3136 transitions. [2024-10-10 22:29:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-10 22:29:36,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:36,113 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:36,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:29:36,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:36,320 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:36,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:36,321 INFO L85 PathProgramCache]: Analyzing trace with hash -95208810, now seen corresponding path program 1 times [2024-10-10 22:29:36,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:36,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520184672] [2024-10-10 22:29:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 442 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 22:29:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520184672] [2024-10-10 22:29:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520184672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353785980] [2024-10-10 22:29:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:36,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:36,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:36,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:36,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:29:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:36,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:29:36,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-10 22:29:36,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-10 22:29:36,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353785980] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:36,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:36,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-10-10 22:29:36,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504694525] [2024-10-10 22:29:36,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:36,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:29:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:29:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:36,661 INFO L87 Difference]: Start difference. First operand 2268 states and 3136 transitions. Second operand has 10 states, 10 states have (on average 31.0) internal successors, (310), 10 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:37,252 INFO L93 Difference]: Finished difference Result 4887 states and 6933 transitions. [2024-10-10 22:29:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:29:37,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 31.0) internal successors, (310), 10 states have internal predecessors, (310), 0 states have call successors, (0), 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 298 [2024-10-10 22:29:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:37,261 INFO L225 Difference]: With dead ends: 4887 [2024-10-10 22:29:37,261 INFO L226 Difference]: Without dead ends: 1964 [2024-10-10 22:29:37,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 596 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-10-10 22:29:37,264 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 498 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:37,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1408 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:29:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-10-10 22:29:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1731. [2024-10-10 22:29:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1730 states have (on average 1.3867052023121387) internal successors, (2399), 1730 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2399 transitions. [2024-10-10 22:29:37,303 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2399 transitions. Word has length 298 [2024-10-10 22:29:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:37,304 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2399 transitions. [2024-10-10 22:29:37,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.0) internal successors, (310), 10 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2399 transitions. [2024-10-10 22:29:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-10 22:29:37,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:37,307 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:37,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:37,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-10 22:29:37,508 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:37,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 105712074, now seen corresponding path program 1 times [2024-10-10 22:29:37,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:37,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262537895] [2024-10-10 22:29:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 440 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 22:29:37,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262537895] [2024-10-10 22:29:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262537895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261362696] [2024-10-10 22:29:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:37,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:37,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:37,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:29:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:37,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:29:37,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2024-10-10 22:29:37,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:37,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261362696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:37,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 22:29:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505956576] [2024-10-10 22:29:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:37,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:29:37,968 INFO L87 Difference]: Start difference. First operand 1731 states and 2399 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:37,985 INFO L93 Difference]: Finished difference Result 1736 states and 2403 transitions. [2024-10-10 22:29:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:37,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 299 [2024-10-10 22:29:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:37,988 INFO L225 Difference]: With dead ends: 1736 [2024-10-10 22:29:37,988 INFO L226 Difference]: Without dead ends: 1127 [2024-10-10 22:29:37,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 299 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-10-10 22:29:37,989 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 54 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:37,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-10-10 22:29:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1125. [2024-10-10 22:29:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3772241992882561) internal successors, (1548), 1124 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1548 transitions. [2024-10-10 22:29:38,001 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1548 transitions. Word has length 299 [2024-10-10 22:29:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:38,002 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1548 transitions. [2024-10-10 22:29:38,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1548 transitions. [2024-10-10 22:29:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-10-10 22:29:38,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:38,003 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:38,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:38,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-10 22:29:38,207 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:38,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash -778066818, now seen corresponding path program 1 times [2024-10-10 22:29:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870340548] [2024-10-10 22:29:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:38,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 22:29:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870340548] [2024-10-10 22:29:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870340548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455424028] [2024-10-10 22:29:38,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:38,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:38,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:38,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:38,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:29:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:38,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:29:38,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 22:29:38,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 22:29:38,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455424028] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:38,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:38,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-10 22:29:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320720939] [2024-10-10 22:29:38,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:38,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:29:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:38,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:29:38,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:38,557 INFO L87 Difference]: Start difference. First operand 1125 states and 1548 transitions. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:38,914 INFO L93 Difference]: Finished difference Result 2897 states and 4046 transitions. [2024-10-10 22:29:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:29:38,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 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-10-10 22:29:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:38,917 INFO L225 Difference]: With dead ends: 2897 [2024-10-10 22:29:38,917 INFO L226 Difference]: Without dead ends: 1721 [2024-10-10 22:29:38,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 602 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-10-10 22:29:38,918 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 204 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:38,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 767 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:29:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-10-10 22:29:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1276. [2024-10-10 22:29:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.3913725490196078) internal successors, (1774), 1275 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1774 transitions. [2024-10-10 22:29:38,933 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1774 transitions. Word has length 301 [2024-10-10 22:29:38,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:38,933 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1774 transitions. [2024-10-10 22:29:38,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1774 transitions. [2024-10-10 22:29:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-10 22:29:38,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:38,935 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:38,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:29:39,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-10 22:29:39,137 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:39,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash -310209158, now seen corresponding path program 1 times [2024-10-10 22:29:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:39,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822867098] [2024-10-10 22:29:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 596 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-10-10 22:29:39,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:39,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822867098] [2024-10-10 22:29:39,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822867098] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:39,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376449576] [2024-10-10 22:29:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:39,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:39,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:39,227 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:39,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:29:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:39,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:29:39,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 596 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-10-10 22:29:39,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 596 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2024-10-10 22:29:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376449576] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:39,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:39,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-10 22:29:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726194765] [2024-10-10 22:29:39,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:39,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:29:39,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:39,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:29:39,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:39,474 INFO L87 Difference]: Start difference. First operand 1276 states and 1774 transitions. Second operand has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:39,678 INFO L93 Difference]: Finished difference Result 1833 states and 2515 transitions. [2024-10-10 22:29:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:29:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 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 324 [2024-10-10 22:29:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:39,680 INFO L225 Difference]: With dead ends: 1833 [2024-10-10 22:29:39,680 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:29:39,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 647 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-10-10 22:29:39,681 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 128 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:39,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 350 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:29:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:29:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:29:39,682 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2024-10-10 22:29:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:39,683 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:29:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:29:39,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:29:39,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:29:39,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:39,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:39,889 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:39,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:29:41,283 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:29:41,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:29:41 BoogieIcfgContainer [2024-10-10 22:29:41,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:29:41,297 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:29:41,297 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:29:41,297 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:29:41,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:29" (3/4) ... [2024-10-10 22:29:41,299 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:29:41,308 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 22:29:41,309 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-10 22:29:41,309 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:29:41,309 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:29:41,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:29:41,394 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:29:41,394 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:29:41,394 INFO L158 Benchmark]: Toolchain (without parser) took 13455.28ms. Allocated memory was 205.5MB in the beginning and 507.5MB in the end (delta: 302.0MB). Free memory was 135.9MB in the beginning and 402.9MB in the end (delta: -267.0MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-10-10 22:29:41,395 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory was 103.9MB in the beginning and 103.8MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:29:41,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.40ms. Allocated memory is still 205.5MB. Free memory was 135.7MB in the beginning and 118.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 22:29:41,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.71ms. Allocated memory is still 205.5MB. Free memory was 118.4MB in the beginning and 115.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:29:41,395 INFO L158 Benchmark]: Boogie Preprocessor took 62.10ms. Allocated memory is still 205.5MB. Free memory was 115.4MB in the beginning and 112.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:29:41,395 INFO L158 Benchmark]: RCFGBuilder took 695.24ms. Allocated memory is still 205.5MB. Free memory was 112.4MB in the beginning and 134.4MB in the end (delta: -22.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 22:29:41,395 INFO L158 Benchmark]: TraceAbstraction took 12279.55ms. Allocated memory was 205.5MB in the beginning and 507.5MB in the end (delta: 302.0MB). Free memory was 133.6MB in the beginning and 413.4MB in the end (delta: -279.8MB). Peak memory consumption was 272.5MB. Max. memory is 16.1GB. [2024-10-10 22:29:41,396 INFO L158 Benchmark]: Witness Printer took 96.81ms. Allocated memory is still 507.5MB. Free memory was 412.4MB in the beginning and 402.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 22:29:41,397 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.13ms. Allocated memory is still 136.3MB. Free memory was 103.9MB in the beginning and 103.8MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.40ms. Allocated memory is still 205.5MB. Free memory was 135.7MB in the beginning and 118.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.71ms. Allocated memory is still 205.5MB. Free memory was 118.4MB in the beginning and 115.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.10ms. Allocated memory is still 205.5MB. Free memory was 115.4MB in the beginning and 112.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.24ms. Allocated memory is still 205.5MB. Free memory was 112.4MB in the beginning and 134.4MB in the end (delta: -22.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12279.55ms. Allocated memory was 205.5MB in the beginning and 507.5MB in the end (delta: 302.0MB). Free memory was 133.6MB in the beginning and 413.4MB in the end (delta: -279.8MB). Peak memory consumption was 272.5MB. Max. memory is 16.1GB. * Witness Printer took 96.81ms. Allocated memory is still 507.5MB. Free memory was 412.4MB in the beginning and 402.9MB in the end (delta: 9.5MB). 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, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 24, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2304 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2304 mSDsluCounter, 8933 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4418 mSDsCounter, 416 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4299 IncrementalHoareTripleChecker+Invalid, 4715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 416 mSolverCounterUnsat, 4515 mSDtfsCounter, 4299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3376 GetRequests, 3309 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2361occurred 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, 2017 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 6191 NumberOfCodeBlocks, 6191 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 7376 ConstructedInterpolants, 0 QuantifiedInterpolants, 9890 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3827 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 21908/22129 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-10-10 22:29:41,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE