./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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:39:10,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:39:10,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:39:10,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:39:10,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:39:10,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:39:10,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:39:10,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:39:10,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:39:10,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:39:10,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:39:10,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:39:10,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:39:10,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:39:10,814 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:39:10,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:39:10,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:39:10,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:39:10,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:39:10,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:39:10,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:39:10,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:39:10,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:39:10,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:39:10,819 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:39:10,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:39:10,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:39:10,820 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:39:10,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:39:10,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:39:10,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:39:10,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:39:10,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:10,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:39:10,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:39:10,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:39:10,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:39:10,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:39:10,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:39:10,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:39:10,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:39:10,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:39:10,825 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2024-10-13 22:39:11,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:39:11,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:39:11,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:39:11,116 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:39:11,117 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:39:11,118 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-13 22:39:12,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:39:12,746 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:39:12,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-10-13 22:39:12,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8895ad06/1db37fbe832547ebbb1702df70bbf239/FLAG8189ade7e [2024-10-13 22:39:13,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8895ad06/1db37fbe832547ebbb1702df70bbf239 [2024-10-13 22:39:13,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:39:13,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:39:13,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:13,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:39:13,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:39:13,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a56904f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13, skipping insertion in model container [2024-10-13 22:39:13,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:39:13,355 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-13 22:39:13,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:13,391 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:39:13,437 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-13 22:39:13,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:13,454 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:39:13,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13 WrapperNode [2024-10-13 22:39:13,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:13,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:13,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:39:13,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:39:13,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,505 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 529 [2024-10-13 22:39:13,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:13,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:39:13,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:39:13,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:39:13,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,548 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-13 22:39:13,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:39:13,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:39:13,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:39:13,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:39:13,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (1/1) ... [2024-10-13 22:39:13,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:13,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:13,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 22:39:13,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 22:39:13,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:39:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:39:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:39:13,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:39:13,740 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:39:13,741 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:39:13,754 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 22:39:14,190 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-10-13 22:39:14,192 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-10-13 22:39:14,239 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-13 22:39:14,239 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:39:14,283 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:39:14,284 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:39:14,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:14 BoogieIcfgContainer [2024-10-13 22:39:14,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:39:14,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:39:14,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:39:14,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:39:14,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:39:13" (1/3) ... [2024-10-13 22:39:14,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c934ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:14, skipping insertion in model container [2024-10-13 22:39:14,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:13" (2/3) ... [2024-10-13 22:39:14,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c934ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:14, skipping insertion in model container [2024-10-13 22:39:14,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:14" (3/3) ... [2024-10-13 22:39:14,296 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2024-10-13 22:39:14,314 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:39:14,315 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:39:14,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:39:14,396 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;@3c598f9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:39:14,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:39:14,402 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-13 22:39:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 22:39:14,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:14,411 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-13 22:39:14,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1091064671, now seen corresponding path program 1 times [2024-10-13 22:39:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727667564] [2024-10-13 22:39:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:14,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:14,644 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-13 22:39:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727667564] [2024-10-13 22:39:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727667564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:39:14,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386279245] [2024-10-13 22:39:14,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:14,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:14,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:14,685 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-13 22:39:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:14,862 INFO L93 Difference]: Finished difference Result 249 states and 433 transitions. [2024-10-13 22:39:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:14,866 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-13 22:39:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:14,887 INFO L225 Difference]: With dead ends: 249 [2024-10-13 22:39:14,888 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 22:39:14,896 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-13 22:39:14,905 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-13 22:39:14,906 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-13 22:39:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 22:39:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-13 22:39:14,972 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-13 22:39:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2024-10-13 22:39:14,974 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 23 [2024-10-13 22:39:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:14,975 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2024-10-13 22:39:14,975 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-13 22:39:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2024-10-13 22:39:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 22:39:14,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:14,977 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-13 22:39:14,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:39:14,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:14,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1983510372, now seen corresponding path program 1 times [2024-10-13 22:39:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:14,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039518993] [2024-10-13 22:39:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:15,075 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-13 22:39:15,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:15,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039518993] [2024-10-13 22:39:15,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039518993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:15,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:15,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898963639] [2024-10-13 22:39:15,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:15,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:15,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:15,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:15,078 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-13 22:39:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:15,215 INFO L93 Difference]: Finished difference Result 239 states and 369 transitions. [2024-10-13 22:39:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:15,216 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-13 22:39:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:15,217 INFO L225 Difference]: With dead ends: 239 [2024-10-13 22:39:15,218 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 22:39:15,218 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-13 22:39:15,219 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:15,220 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.1s Time] [2024-10-13 22:39:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 22:39:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-13 22:39:15,233 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-13 22:39:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-10-13 22:39:15,236 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 33 [2024-10-13 22:39:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:15,236 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-10-13 22:39:15,236 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-13 22:39:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-10-13 22:39:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:39:15,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:15,238 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-13 22:39:15,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:39:15,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:15,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2051034107, now seen corresponding path program 1 times [2024-10-13 22:39:15,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:15,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842499973] [2024-10-13 22:39:15,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:15,358 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-13 22:39:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842499973] [2024-10-13 22:39:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842499973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:15,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:15,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:39:15,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808892576] [2024-10-13 22:39:15,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:15,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:15,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:15,365 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-13 22:39:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:15,393 INFO L93 Difference]: Finished difference Result 277 states and 414 transitions. [2024-10-13 22:39:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:15,394 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-13 22:39:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:15,395 INFO L225 Difference]: With dead ends: 277 [2024-10-13 22:39:15,396 INFO L226 Difference]: Without dead ends: 155 [2024-10-13 22:39:15,396 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-13 22:39:15,397 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-13 22:39:15,398 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-13 22:39:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-13 22:39:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-13 22:39:15,405 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-13 22:39:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2024-10-13 22:39:15,406 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 46 [2024-10-13 22:39:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:15,407 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2024-10-13 22:39:15,407 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-13 22:39:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2024-10-13 22:39:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:39:15,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:15,409 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-13 22:39:15,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:39:15,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:15,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash -438494855, now seen corresponding path program 1 times [2024-10-13 22:39:15,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:15,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173974858] [2024-10-13 22:39:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:15,491 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-13 22:39:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173974858] [2024-10-13 22:39:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173974858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355429578] [2024-10-13 22:39:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:15,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:15,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:15,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:15,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:15,494 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-13 22:39:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:15,635 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2024-10-13 22:39:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:15,636 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-13 22:39:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:15,638 INFO L225 Difference]: With dead ends: 293 [2024-10-13 22:39:15,638 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 22:39:15,640 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-13 22:39:15,641 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-13 22:39:15,643 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-13 22:39:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 22:39:15,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-13 22:39:15,662 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-13 22:39:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 250 transitions. [2024-10-13 22:39:15,663 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 250 transitions. Word has length 46 [2024-10-13 22:39:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:15,666 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 250 transitions. [2024-10-13 22:39:15,666 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-13 22:39:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2024-10-13 22:39:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 22:39:15,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:15,668 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-13 22:39:15,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:39:15,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:15,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1782095985, now seen corresponding path program 1 times [2024-10-13 22:39:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591070703] [2024-10-13 22:39:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:15,754 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-13 22:39:15,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:15,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591070703] [2024-10-13 22:39:15,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591070703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:15,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:15,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368855798] [2024-10-13 22:39:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:15,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:15,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:15,756 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-13 22:39:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:15,788 INFO L93 Difference]: Finished difference Result 464 states and 679 transitions. [2024-10-13 22:39:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:15,789 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-13 22:39:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:15,792 INFO L225 Difference]: With dead ends: 464 [2024-10-13 22:39:15,792 INFO L226 Difference]: Without dead ends: 326 [2024-10-13 22:39:15,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:15,793 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-13 22:39:15,794 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-13 22:39:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-13 22:39:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-10-13 22:39:15,808 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-13 22:39:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 470 transitions. [2024-10-13 22:39:15,809 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 470 transitions. Word has length 64 [2024-10-13 22:39:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:15,810 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 470 transitions. [2024-10-13 22:39:15,810 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-13 22:39:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 470 transitions. [2024-10-13 22:39:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 22:39:15,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:15,813 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-13 22:39:15,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:39:15,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:15,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1762519458, now seen corresponding path program 1 times [2024-10-13 22:39:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486692429] [2024-10-13 22:39:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:15,932 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-13 22:39:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:15,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486692429] [2024-10-13 22:39:15,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486692429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:15,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:15,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:15,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990160996] [2024-10-13 22:39:15,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:15,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:15,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:15,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:15,934 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-13 22:39:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:15,979 INFO L93 Difference]: Finished difference Result 850 states and 1251 transitions. [2024-10-13 22:39:15,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:15,981 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-13 22:39:15,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:15,984 INFO L225 Difference]: With dead ends: 850 [2024-10-13 22:39:15,984 INFO L226 Difference]: Without dead ends: 585 [2024-10-13 22:39:15,985 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-13 22:39:15,988 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-13 22:39:15,988 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-13 22:39:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-13 22:39:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2024-10-13 22:39:16,020 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-13 22:39:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 847 transitions. [2024-10-13 22:39:16,023 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 847 transitions. Word has length 64 [2024-10-13 22:39:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:16,023 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 847 transitions. [2024-10-13 22:39:16,024 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-13 22:39:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 847 transitions. [2024-10-13 22:39:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 22:39:16,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:16,029 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-13 22:39:16,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 22:39:16,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:16,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1557452356, now seen corresponding path program 1 times [2024-10-13 22:39:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:16,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751128630] [2024-10-13 22:39:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:16,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:16,083 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-13 22:39:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751128630] [2024-10-13 22:39:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751128630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757240492] [2024-10-13 22:39:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:16,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:16,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:16,085 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-13 22:39:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:16,121 INFO L93 Difference]: Finished difference Result 1151 states and 1670 transitions. [2024-10-13 22:39:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:16,122 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-13 22:39:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:16,124 INFO L225 Difference]: With dead ends: 1151 [2024-10-13 22:39:16,125 INFO L226 Difference]: Without dead ends: 625 [2024-10-13 22:39:16,125 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-13 22:39:16,126 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-13 22:39:16,126 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-13 22:39:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-10-13 22:39:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2024-10-13 22:39:16,143 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-13 22:39:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 899 transitions. [2024-10-13 22:39:16,145 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 899 transitions. Word has length 65 [2024-10-13 22:39:16,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:16,146 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 899 transitions. [2024-10-13 22:39:16,146 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-13 22:39:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 899 transitions. [2024-10-13 22:39:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 22:39:16,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:16,149 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-13 22:39:16,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 22:39:16,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -991205824, now seen corresponding path program 1 times [2024-10-13 22:39:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:16,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195231022] [2024-10-13 22:39:16,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:16,214 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-13 22:39:16,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:16,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195231022] [2024-10-13 22:39:16,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195231022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:16,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:16,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530070737] [2024-10-13 22:39:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:16,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:16,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:16,216 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-13 22:39:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:16,360 INFO L93 Difference]: Finished difference Result 1271 states and 1868 transitions. [2024-10-13 22:39:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:16,361 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-13 22:39:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:16,364 INFO L225 Difference]: With dead ends: 1271 [2024-10-13 22:39:16,365 INFO L226 Difference]: Without dead ends: 705 [2024-10-13 22:39:16,366 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-13 22:39:16,368 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-13 22:39:16,369 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-13 22:39:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-13 22:39:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-10-13 22:39:16,383 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-13 22:39:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 999 transitions. [2024-10-13 22:39:16,385 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 999 transitions. Word has length 81 [2024-10-13 22:39:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:16,386 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 999 transitions. [2024-10-13 22:39:16,386 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-13 22:39:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 999 transitions. [2024-10-13 22:39:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 22:39:16,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:16,388 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-13 22:39:16,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:39:16,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:16,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1607137658, now seen corresponding path program 1 times [2024-10-13 22:39:16,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:16,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758433608] [2024-10-13 22:39:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:16,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:16,463 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-13 22:39:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758433608] [2024-10-13 22:39:16,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758433608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:16,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:16,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783695929] [2024-10-13 22:39:16,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:16,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:16,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:16,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:16,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:16,465 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-13 22:39:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:16,523 INFO L93 Difference]: Finished difference Result 1010 states and 1441 transitions. [2024-10-13 22:39:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:16,525 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-13 22:39:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:16,531 INFO L225 Difference]: With dead ends: 1010 [2024-10-13 22:39:16,531 INFO L226 Difference]: Without dead ends: 1008 [2024-10-13 22:39:16,534 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-13 22:39:16,535 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-13 22:39:16,535 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-13 22:39:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-10-13 22:39:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2024-10-13 22:39:16,561 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-13 22:39:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1438 transitions. [2024-10-13 22:39:16,566 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1438 transitions. Word has length 100 [2024-10-13 22:39:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:16,566 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1438 transitions. [2024-10-13 22:39:16,566 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-13 22:39:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1438 transitions. [2024-10-13 22:39:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 22:39:16,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:16,572 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-13 22:39:16,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 22:39:16,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:16,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:16,573 INFO L85 PathProgramCache]: Analyzing trace with hash 438435727, now seen corresponding path program 1 times [2024-10-13 22:39:16,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397787308] [2024-10-13 22:39:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:16,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:16,663 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-13 22:39:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397787308] [2024-10-13 22:39:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397787308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:16,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571486351] [2024-10-13 22:39:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:16,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:16,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:16,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:16,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:16,668 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-13 22:39:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:16,867 INFO L93 Difference]: Finished difference Result 2197 states and 3254 transitions. [2024-10-13 22:39:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:16,867 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-13 22:39:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:16,873 INFO L225 Difference]: With dead ends: 2197 [2024-10-13 22:39:16,873 INFO L226 Difference]: Without dead ends: 1242 [2024-10-13 22:39:16,875 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-13 22:39:16,875 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:16,876 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.2s Time] [2024-10-13 22:39:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2024-10-13 22:39:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2024-10-13 22:39:16,897 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-13 22:39:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1822 transitions. [2024-10-13 22:39:16,900 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1822 transitions. Word has length 119 [2024-10-13 22:39:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:16,900 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1822 transitions. [2024-10-13 22:39:16,900 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-13 22:39:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1822 transitions. [2024-10-13 22:39:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 22:39:16,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:16,903 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-13 22:39:16,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 22:39:16,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:16,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 126510689, now seen corresponding path program 1 times [2024-10-13 22:39:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975590591] [2024-10-13 22:39:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:16,980 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-13 22:39:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975590591] [2024-10-13 22:39:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975590591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:16,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:16,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950232259] [2024-10-13 22:39:16,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:16,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:16,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:16,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:16,982 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-13 22:39:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:17,160 INFO L93 Difference]: Finished difference Result 2899 states and 4406 transitions. [2024-10-13 22:39:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:17,161 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-13 22:39:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:17,167 INFO L225 Difference]: With dead ends: 2899 [2024-10-13 22:39:17,167 INFO L226 Difference]: Without dead ends: 1614 [2024-10-13 22:39:17,169 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-13 22:39:17,170 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:17,170 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.2s Time] [2024-10-13 22:39:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-13 22:39:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1608. [2024-10-13 22:39:17,198 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-13 22:39:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2314 transitions. [2024-10-13 22:39:17,203 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2314 transitions. Word has length 142 [2024-10-13 22:39:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:17,221 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2314 transitions. [2024-10-13 22:39:17,222 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-13 22:39:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2314 transitions. [2024-10-13 22:39:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 22:39:17,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:17,226 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-13 22:39:17,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 22:39:17,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:17,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:17,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2147459693, now seen corresponding path program 1 times [2024-10-13 22:39:17,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:17,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857908768] [2024-10-13 22:39:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:17,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:17,301 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-13 22:39:17,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:17,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857908768] [2024-10-13 22:39:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857908768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:17,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:17,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819230276] [2024-10-13 22:39:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:17,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:17,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:17,304 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-13 22:39:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:17,486 INFO L93 Difference]: Finished difference Result 3397 states and 4940 transitions. [2024-10-13 22:39:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:17,487 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-13 22:39:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:17,493 INFO L225 Difference]: With dead ends: 3397 [2024-10-13 22:39:17,493 INFO L226 Difference]: Without dead ends: 1758 [2024-10-13 22:39:17,495 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-13 22:39:17,496 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:17,496 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.2s Time] [2024-10-13 22:39:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-10-13 22:39:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1752. [2024-10-13 22:39:17,528 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-13 22:39:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2500 transitions. [2024-10-13 22:39:17,534 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2500 transitions. Word has length 162 [2024-10-13 22:39:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:17,534 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2500 transitions. [2024-10-13 22:39:17,534 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-13 22:39:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2500 transitions. [2024-10-13 22:39:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 22:39:17,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:17,538 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-13 22:39:17,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 22:39:17,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2018596588, now seen corresponding path program 1 times [2024-10-13 22:39:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:17,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719987035] [2024-10-13 22:39:17,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:17,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:17,616 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-13 22:39:17,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:17,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719987035] [2024-10-13 22:39:17,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719987035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:17,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:17,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374390952] [2024-10-13 22:39:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:17,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:17,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:17,619 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-13 22:39:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:17,789 INFO L93 Difference]: Finished difference Result 3691 states and 5318 transitions. [2024-10-13 22:39:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:17,790 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-13 22:39:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:17,796 INFO L225 Difference]: With dead ends: 3691 [2024-10-13 22:39:17,796 INFO L226 Difference]: Without dead ends: 1920 [2024-10-13 22:39:17,799 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-13 22:39:17,800 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-13 22:39:17,800 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-13 22:39:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2024-10-13 22:39:17,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1914. [2024-10-13 22:39:17,862 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-13 22:39:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2716 transitions. [2024-10-13 22:39:17,868 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2716 transitions. Word has length 185 [2024-10-13 22:39:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2716 transitions. [2024-10-13 22:39:17,869 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-13 22:39:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2716 transitions. [2024-10-13 22:39:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 22:39:17,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:17,872 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-13 22:39:17,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 22:39:17,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:17,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2072989486, now seen corresponding path program 1 times [2024-10-13 22:39:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786222883] [2024-10-13 22:39:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:17,944 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-13 22:39:17,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:17,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786222883] [2024-10-13 22:39:17,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786222883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:17,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:17,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157186280] [2024-10-13 22:39:17,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:17,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:17,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:17,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:17,946 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-13 22:39:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:18,129 INFO L93 Difference]: Finished difference Result 4009 states and 5744 transitions. [2024-10-13 22:39:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:18,129 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-13 22:39:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:18,136 INFO L225 Difference]: With dead ends: 4009 [2024-10-13 22:39:18,137 INFO L226 Difference]: Without dead ends: 2100 [2024-10-13 22:39:18,139 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-13 22:39:18,140 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:18,140 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.2s Time] [2024-10-13 22:39:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-10-13 22:39:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2094. [2024-10-13 22:39:18,178 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-13 22:39:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2974 transitions. [2024-10-13 22:39:18,184 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2974 transitions. Word has length 185 [2024-10-13 22:39:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:18,184 INFO L471 AbstractCegarLoop]: Abstraction has 2094 states and 2974 transitions. [2024-10-13 22:39:18,184 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-13 22:39:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2974 transitions. [2024-10-13 22:39:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 22:39:18,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:18,188 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-13 22:39:18,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 22:39:18,189 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:18,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:18,189 INFO L85 PathProgramCache]: Analyzing trace with hash 457007458, now seen corresponding path program 1 times [2024-10-13 22:39:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:18,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350769872] [2024-10-13 22:39:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:18,293 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-13 22:39:18,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350769872] [2024-10-13 22:39:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350769872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686497462] [2024-10-13 22:39:18,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:18,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:18,296 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-13 22:39:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:18,496 INFO L93 Difference]: Finished difference Result 4369 states and 6260 transitions. [2024-10-13 22:39:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:18,497 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-13 22:39:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:18,504 INFO L225 Difference]: With dead ends: 4369 [2024-10-13 22:39:18,504 INFO L226 Difference]: Without dead ends: 2304 [2024-10-13 22:39:18,506 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-13 22:39:18,507 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:18,509 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.1s Time] [2024-10-13 22:39:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-10-13 22:39:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2298. [2024-10-13 22:39:18,548 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-13 22:39:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 3280 transitions. [2024-10-13 22:39:18,553 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 3280 transitions. Word has length 214 [2024-10-13 22:39:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:18,554 INFO L471 AbstractCegarLoop]: Abstraction has 2298 states and 3280 transitions. [2024-10-13 22:39:18,554 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-13 22:39:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 3280 transitions. [2024-10-13 22:39:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-13 22:39:18,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:18,559 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-13 22:39:18,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 22:39:18,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:18,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1369202223, now seen corresponding path program 1 times [2024-10-13 22:39:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580717495] [2024-10-13 22:39:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:18,662 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-13 22:39:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580717495] [2024-10-13 22:39:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580717495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:18,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35818940] [2024-10-13 22:39:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:18,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:18,664 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-13 22:39:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:18,857 INFO L93 Difference]: Finished difference Result 4543 states and 6488 transitions. [2024-10-13 22:39:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:18,858 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-13 22:39:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:18,865 INFO L225 Difference]: With dead ends: 4543 [2024-10-13 22:39:18,866 INFO L226 Difference]: Without dead ends: 2286 [2024-10-13 22:39:18,869 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-13 22:39:18,869 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:18,870 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.2s Time] [2024-10-13 22:39:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2024-10-13 22:39:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2280. [2024-10-13 22:39:18,917 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-13 22:39:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3226 transitions. [2024-10-13 22:39:18,923 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3226 transitions. Word has length 248 [2024-10-13 22:39:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:18,924 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3226 transitions. [2024-10-13 22:39:18,924 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-13 22:39:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3226 transitions. [2024-10-13 22:39:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-13 22:39:18,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:18,930 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-13 22:39:18,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 22:39:18,930 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:18,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1133924132, now seen corresponding path program 1 times [2024-10-13 22:39:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:18,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146985948] [2024-10-13 22:39:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:19,166 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-13 22:39:19,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146985948] [2024-10-13 22:39:19,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146985948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816366018] [2024-10-13 22:39:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:19,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:19,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:19,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:19,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 22:39:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:19,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:19,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:19,398 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-13 22:39:19,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:19,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816366018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:19,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 22:39:19,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368263785] [2024-10-13 22:39:19,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:19,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:19,402 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-13 22:39:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:19,553 INFO L93 Difference]: Finished difference Result 4507 states and 6380 transitions. [2024-10-13 22:39:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:19,553 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-13 22:39:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:19,560 INFO L225 Difference]: With dead ends: 4507 [2024-10-13 22:39:19,560 INFO L226 Difference]: Without dead ends: 2286 [2024-10-13 22:39:19,563 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-13 22:39:19,563 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-13 22:39:19,564 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-13 22:39:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2024-10-13 22:39:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2280. [2024-10-13 22:39:19,605 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-13 22:39:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3172 transitions. [2024-10-13 22:39:19,612 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3172 transitions. Word has length 260 [2024-10-13 22:39:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:19,612 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3172 transitions. [2024-10-13 22:39:19,612 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-13 22:39:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3172 transitions. [2024-10-13 22:39:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-13 22:39:19,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:19,618 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-13 22:39:19,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:19,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 22:39:19,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:19,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash 182966378, now seen corresponding path program 1 times [2024-10-13 22:39:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553911928] [2024-10-13 22:39:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:19,999 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-13 22:39:19,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553911928] [2024-10-13 22:39:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553911928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918946847] [2024-10-13 22:39:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:20,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:20,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:20,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:20,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 22:39:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:20,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:20,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:20,191 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-13 22:39:20,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918946847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:20,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:20,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 22:39:20,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446923139] [2024-10-13 22:39:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:20,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:20,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:20,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:20,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:20,194 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-13 22:39:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:20,384 INFO L93 Difference]: Finished difference Result 4744 states and 6551 transitions. [2024-10-13 22:39:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:20,385 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-13 22:39:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:20,393 INFO L225 Difference]: With dead ends: 4744 [2024-10-13 22:39:20,393 INFO L226 Difference]: Without dead ends: 2523 [2024-10-13 22:39:20,396 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-13 22:39:20,397 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:20,397 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.2s Time] [2024-10-13 22:39:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2024-10-13 22:39:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2361. [2024-10-13 22:39:20,444 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-13 22:39:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3283 transitions. [2024-10-13 22:39:20,451 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3283 transitions. Word has length 285 [2024-10-13 22:39:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:20,451 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 3283 transitions. [2024-10-13 22:39:20,451 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-13 22:39:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3283 transitions. [2024-10-13 22:39:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-13 22:39:20,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:20,457 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-13 22:39:20,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 22:39:20,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 22:39:20,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 125937572, now seen corresponding path program 1 times [2024-10-13 22:39:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260834333] [2024-10-13 22:39:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:20,787 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-13 22:39:20,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260834333] [2024-10-13 22:39:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260834333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447444522] [2024-10-13 22:39:20,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:20,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:20,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:20,791 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-13 22:39:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:20,959 INFO L93 Difference]: Finished difference Result 4825 states and 6650 transitions. [2024-10-13 22:39:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:20,959 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-13 22:39:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:20,966 INFO L225 Difference]: With dead ends: 4825 [2024-10-13 22:39:20,966 INFO L226 Difference]: Without dead ends: 2277 [2024-10-13 22:39:20,969 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-13 22:39:20,970 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-13 22:39:20,970 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-13 22:39:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2024-10-13 22:39:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2268. [2024-10-13 22:39:21,015 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-13 22:39:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3142 transitions. [2024-10-13 22:39:21,020 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3142 transitions. Word has length 286 [2024-10-13 22:39:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:21,021 INFO L471 AbstractCegarLoop]: Abstraction has 2268 states and 3142 transitions. [2024-10-13 22:39:21,021 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-13 22:39:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3142 transitions. [2024-10-13 22:39:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-13 22:39:21,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:21,026 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-13 22:39:21,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 22:39:21,027 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2133389154, now seen corresponding path program 1 times [2024-10-13 22:39:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69141371] [2024-10-13 22:39:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:21,177 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-13 22:39:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69141371] [2024-10-13 22:39:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69141371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312107453] [2024-10-13 22:39:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:21,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:21,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:21,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 22:39:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:21,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:39:21,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:21,462 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-13 22:39:21,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:21,564 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-13 22:39:21,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312107453] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:21,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:21,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-13 22:39:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439531133] [2024-10-13 22:39:21,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:21,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:39:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:39:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:39:21,567 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-13 22:39:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:22,023 INFO L93 Difference]: Finished difference Result 5725 states and 7986 transitions. [2024-10-13 22:39:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:39:22,026 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-13 22:39:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:22,047 INFO L225 Difference]: With dead ends: 5725 [2024-10-13 22:39:22,048 INFO L226 Difference]: Without dead ends: 3390 [2024-10-13 22:39:22,051 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-13 22:39:22,052 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 463 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:22,052 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.4s Time] [2024-10-13 22:39:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2024-10-13 22:39:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 2268. [2024-10-13 22:39:22,112 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-13 22:39:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3136 transitions. [2024-10-13 22:39:22,119 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3136 transitions. Word has length 297 [2024-10-13 22:39:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:22,120 INFO L471 AbstractCegarLoop]: Abstraction has 2268 states and 3136 transitions. [2024-10-13 22:39:22,120 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-13 22:39:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3136 transitions. [2024-10-13 22:39:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-13 22:39:22,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:22,126 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-13 22:39:22,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:22,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:22,327 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:22,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:22,328 INFO L85 PathProgramCache]: Analyzing trace with hash -95208810, now seen corresponding path program 1 times [2024-10-13 22:39:22,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:22,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814843783] [2024-10-13 22:39:22,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:22,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:22,463 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-13 22:39:22,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:22,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814843783] [2024-10-13 22:39:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814843783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419217152] [2024-10-13 22:39:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:22,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:22,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:22,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:22,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 22:39:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:22,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:39:22,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:22,735 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-13 22:39:22,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:22,851 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-13 22:39:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419217152] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:22,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:22,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-10-13 22:39:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052546791] [2024-10-13 22:39:22,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:22,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 22:39:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:22,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 22:39:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:39:22,855 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-13 22:39:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:23,674 INFO L93 Difference]: Finished difference Result 4887 states and 6933 transitions. [2024-10-13 22:39:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 22:39:23,675 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-13 22:39:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:23,680 INFO L225 Difference]: With dead ends: 4887 [2024-10-13 22:39:23,680 INFO L226 Difference]: Without dead ends: 1964 [2024-10-13 22:39:23,684 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-13 22:39:23,685 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 498 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:23,685 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.7s Time] [2024-10-13 22:39:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-10-13 22:39:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1731. [2024-10-13 22:39:23,713 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-13 22:39:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2399 transitions. [2024-10-13 22:39:23,716 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2399 transitions. Word has length 298 [2024-10-13 22:39:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:23,716 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2399 transitions. [2024-10-13 22:39:23,716 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-13 22:39:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2399 transitions. [2024-10-13 22:39:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-13 22:39:23,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:23,722 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-13 22:39:23,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 22:39:23,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:23,923 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:23,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash 105712074, now seen corresponding path program 1 times [2024-10-13 22:39:23,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:23,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260957868] [2024-10-13 22:39:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,051 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-13 22:39:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260957868] [2024-10-13 22:39:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260957868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451130040] [2024-10-13 22:39:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:24,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:24,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:24,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 22:39:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:39:24,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:24,534 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-13 22:39:24,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:24,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451130040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:24,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:39:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 22:39:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154677213] [2024-10-13 22:39:24,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:24,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:24,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:39:24,538 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-13 22:39:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:24,555 INFO L93 Difference]: Finished difference Result 1736 states and 2403 transitions. [2024-10-13 22:39:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:24,556 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-13 22:39:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:24,558 INFO L225 Difference]: With dead ends: 1736 [2024-10-13 22:39:24,558 INFO L226 Difference]: Without dead ends: 1127 [2024-10-13 22:39:24,564 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-13 22:39:24,564 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-13 22:39:24,565 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-13 22:39:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-10-13 22:39:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1125. [2024-10-13 22:39:24,582 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-13 22:39:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1548 transitions. [2024-10-13 22:39:24,584 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1548 transitions. Word has length 299 [2024-10-13 22:39:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:24,584 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1548 transitions. [2024-10-13 22:39:24,584 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-13 22:39:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1548 transitions. [2024-10-13 22:39:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-10-13 22:39:24,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:24,588 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-13 22:39:24,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 22:39:24,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 22:39:24,789 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:24,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash -778066818, now seen corresponding path program 1 times [2024-10-13 22:39:24,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:24,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713842421] [2024-10-13 22:39:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,906 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-13 22:39:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713842421] [2024-10-13 22:39:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713842421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692792514] [2024-10-13 22:39:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:24,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:24,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:24,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 22:39:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:25,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:39:25,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:25,125 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-13 22:39:25,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:25,193 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-13 22:39:25,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692792514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:25,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:25,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-13 22:39:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605072722] [2024-10-13 22:39:25,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:25,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:25,196 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-13 22:39:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:25,597 INFO L93 Difference]: Finished difference Result 2897 states and 4046 transitions. [2024-10-13 22:39:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:39:25,598 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-13 22:39:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:25,613 INFO L225 Difference]: With dead ends: 2897 [2024-10-13 22:39:25,613 INFO L226 Difference]: Without dead ends: 1721 [2024-10-13 22:39:25,615 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-13 22:39:25,616 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 204 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:25,616 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.4s Time] [2024-10-13 22:39:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-10-13 22:39:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1276. [2024-10-13 22:39:25,636 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-13 22:39:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1774 transitions. [2024-10-13 22:39:25,638 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1774 transitions. Word has length 301 [2024-10-13 22:39:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:25,638 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1774 transitions. [2024-10-13 22:39:25,638 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-13 22:39:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1774 transitions. [2024-10-13 22:39:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-13 22:39:25,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:25,643 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-13 22:39:25,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 22:39:25,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:25,846 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:25,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash -310209158, now seen corresponding path program 1 times [2024-10-13 22:39:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:25,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147960656] [2024-10-13 22:39:25,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:25,958 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-13 22:39:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147960656] [2024-10-13 22:39:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147960656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932007287] [2024-10-13 22:39:25,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:25,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:25,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:25,960 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:25,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 22:39:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:26,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:39:26,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:26,179 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-13 22:39:26,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:26,241 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-13 22:39:26,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932007287] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:26,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:26,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-13 22:39:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353972244] [2024-10-13 22:39:26,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:26,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:26,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:26,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:26,243 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-13 22:39:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:26,443 INFO L93 Difference]: Finished difference Result 1833 states and 2515 transitions. [2024-10-13 22:39:26,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:39:26,443 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-13 22:39:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:26,444 INFO L225 Difference]: With dead ends: 1833 [2024-10-13 22:39:26,444 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 22:39:26,446 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-13 22:39:26,446 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-13 22:39:26,446 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-13 22:39:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 22:39:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 22:39:26,447 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-13 22:39:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 22:39:26,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2024-10-13 22:39:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:26,448 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 22:39:26,448 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-13 22:39:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 22:39:26,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 22:39:26,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:39:26,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:26,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:26,659 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-13 22:39:26,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 22:39:28,352 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:39:28,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:39:28 BoogieIcfgContainer [2024-10-13 22:39:28,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:39:28,371 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:39:28,371 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:39:28,371 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:39:28,371 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:14" (3/4) ... [2024-10-13 22:39:28,373 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 22:39:28,396 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 22:39:28,396 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 22:39:28,397 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 22:39:28,397 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 22:39:28,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:39:28,535 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 22:39:28,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:39:28,535 INFO L158 Benchmark]: Toolchain (without parser) took 15424.83ms. Allocated memory was 180.4MB in the beginning and 331.4MB in the end (delta: 151.0MB). Free memory was 152.4MB in the beginning and 207.0MB in the end (delta: -54.6MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB. [2024-10-13 22:39:28,535 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:39:28,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.75ms. Allocated memory is still 180.4MB. Free memory was 152.4MB in the beginning and 135.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 22:39:28,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.81ms. Allocated memory is still 180.4MB. Free memory was 135.9MB in the beginning and 133.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:28,536 INFO L158 Benchmark]: Boogie Preprocessor took 60.54ms. Allocated memory is still 180.4MB. Free memory was 133.1MB in the beginning and 129.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 22:39:28,536 INFO L158 Benchmark]: RCFGBuilder took 713.17ms. Allocated memory is still 180.4MB. Free memory was 129.6MB in the beginning and 88.5MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-13 22:39:28,537 INFO L158 Benchmark]: TraceAbstraction took 14082.81ms. Allocated memory was 180.4MB in the beginning and 331.4MB in the end (delta: 151.0MB). Free memory was 87.7MB in the beginning and 216.4MB in the end (delta: -128.7MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. [2024-10-13 22:39:28,537 INFO L158 Benchmark]: Witness Printer took 164.18ms. Allocated memory is still 331.4MB. Free memory was 216.4MB in the beginning and 207.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 22:39:28,538 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.18ms. Allocated memory is still 180.4MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.75ms. Allocated memory is still 180.4MB. Free memory was 152.4MB in the beginning and 135.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.81ms. Allocated memory is still 180.4MB. Free memory was 135.9MB in the beginning and 133.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.54ms. Allocated memory is still 180.4MB. Free memory was 133.1MB in the beginning and 129.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 713.17ms. Allocated memory is still 180.4MB. Free memory was 129.6MB in the beginning and 88.5MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14082.81ms. Allocated memory was 180.4MB in the beginning and 331.4MB in the end (delta: 151.0MB). Free memory was 87.7MB in the beginning and 216.4MB in the end (delta: -128.7MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. * Witness Printer took 164.18ms. Allocated memory is still 331.4MB. Free memory was 216.4MB in the beginning and 207.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 24, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2304 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2304 mSDsluCounter, 8933 SdHoareTripleChecker+Invalid, 3.0s 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.1s 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.7s SatisfiabilityAnalysisTime, 3.2s 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-13 22:39:28,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE