./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i -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 b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:55:34,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:55:34,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:55:34,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:55:34,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:55:34,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:55:34,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:55:34,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:55:34,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:55:34,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:55:34,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:55:34,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:55:34,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:55:34,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:55:34,513 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:55:34,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:55:34,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:55:34,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:55:34,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:55:34,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:55:34,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:55:34,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:55:34,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:55:34,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:55:34,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:55:34,521 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:55:34,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:55:34,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:55:34,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:55:34,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:55:34,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:55:34,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:55:34,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:55:34,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:55:34,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:55:34,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:55:34,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:55:34,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:55:34,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:55:34,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:55:34,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:55:34,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:55:34,527 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 -> b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a [2024-11-10 05:55:34,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:55:34,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:55:34,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:55:34,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:55:34,818 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:55:34,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2024-11-10 05:55:36,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:55:36,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:55:36,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2024-11-10 05:55:36,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ce44860/1cb6b67065974aeeaf46f603fdabc298/FLAGf7cee93b9 [2024-11-10 05:55:36,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ce44860/1cb6b67065974aeeaf46f603fdabc298 [2024-11-10 05:55:36,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:55:36,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:55:36,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:55:36,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:55:36,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:55:36,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:55:36" (1/1) ... [2024-11-10 05:55:36,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166594b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:36, skipping insertion in model container [2024-11-10 05:55:36,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:55:36" (1/1) ... [2024-11-10 05:55:36,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:55:37,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2024-11-10 05:55:37,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:55:37,192 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:55:37,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2024-11-10 05:55:37,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:55:37,259 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:55:37,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37 WrapperNode [2024-11-10 05:55:37,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:55:37,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:55:37,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:55:37,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:55:37,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,322 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-11-10 05:55:37,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:55:37,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:55:37,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:55:37,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:55:37,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,380 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:55:37,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:55:37,413 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:55:37,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:55:37,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:55:37,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (1/1) ... [2024-11-10 05:55:37,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:55:37,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:55:37,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:55:37,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:55:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:55:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:55:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:55:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:55:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:55:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:55:37,629 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:55:37,631 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:55:38,064 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: havoc property_#t~bitwise26#1; [2024-11-10 05:55:38,105 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 05:55:38,109 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:55:38,131 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:55:38,131 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:55:38,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:55:38 BoogieIcfgContainer [2024-11-10 05:55:38,132 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:55:38,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:55:38,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:55:38,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:55:38,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:55:36" (1/3) ... [2024-11-10 05:55:38,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ebe96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:55:38, skipping insertion in model container [2024-11-10 05:55:38,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:37" (2/3) ... [2024-11-10 05:55:38,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ebe96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:55:38, skipping insertion in model container [2024-11-10 05:55:38,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:55:38" (3/3) ... [2024-11-10 05:55:38,141 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2024-11-10 05:55:38,159 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:55:38,160 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:55:38,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:55:38,228 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;@1317b4b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:55:38,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:55:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 05:55:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-10 05:55:38,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:55:38,256 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:55:38,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:55:38,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:55:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash -915168920, now seen corresponding path program 1 times [2024-11-10 05:55:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:55:38,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262061538] [2024-11-10 05:55:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:55:38,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:55:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:55:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:55:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:55:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:55:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:55:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 05:55:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:55:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:55:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:55:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:55:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:55:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:55:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:55:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:55:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:55:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:55:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:55:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:55:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:55:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:55:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:55:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:55:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:55:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:55:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:55:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:55:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:55:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:55:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:55:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:55:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:55:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:55:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:55:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 05:55:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:55:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:55:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262061538] [2024-11-10 05:55:38,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262061538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:55:38,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:55:38,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:55:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278754744] [2024-11-10 05:55:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:55:38,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:55:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:55:38,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:55:38,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:55:38,911 INFO L87 Difference]: Start difference. First operand has 109 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 05:55:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:55:39,012 INFO L93 Difference]: Finished difference Result 210 states and 367 transitions. [2024-11-10 05:55:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:55:39,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 219 [2024-11-10 05:55:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:55:39,028 INFO L225 Difference]: With dead ends: 210 [2024-11-10 05:55:39,029 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 05:55:39,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:55:39,037 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:55:39,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:55:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 05:55:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 05:55:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 05:55:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions. [2024-11-10 05:55:39,093 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 219 [2024-11-10 05:55:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:55:39,094 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 161 transitions. [2024-11-10 05:55:39,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 05:55:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 161 transitions. [2024-11-10 05:55:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-10 05:55:39,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:55:39,098 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:55:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:55:39,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:55:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:55:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1706069880, now seen corresponding path program 1 times [2024-11-10 05:55:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:55:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205480549] [2024-11-10 05:55:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:55:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:55:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:55:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:55:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:55:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:55:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:55:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 05:55:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:55:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:55:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:55:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:55:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:55:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:55:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:55:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:55:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:55:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:55:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:55:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:55:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:55:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:55:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:55:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:55:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:55:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:55:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:55:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:55:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:55:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:55:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:55:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:55:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:55:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:55:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:55:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 05:55:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:55:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:55:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205480549] [2024-11-10 05:55:40,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205480549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:55:40,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:55:40,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:55:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813883060] [2024-11-10 05:55:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:55:40,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:55:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:55:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:55:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:55:40,548 INFO L87 Difference]: Start difference. First operand 104 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:55:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:55:41,665 INFO L93 Difference]: Finished difference Result 406 states and 637 transitions. [2024-11-10 05:55:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 05:55:41,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-11-10 05:55:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:55:41,673 INFO L225 Difference]: With dead ends: 406 [2024-11-10 05:55:41,674 INFO L226 Difference]: Without dead ends: 305 [2024-11-10 05:55:41,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:55:41,678 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 268 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 05:55:41,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 788 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 05:55:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-10 05:55:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 277. [2024-11-10 05:55:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 171 states have internal predecessors, (229), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-10 05:55:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 433 transitions. [2024-11-10 05:55:41,768 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 433 transitions. Word has length 219 [2024-11-10 05:55:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:55:41,769 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 433 transitions. [2024-11-10 05:55:41,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:55:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 433 transitions. [2024-11-10 05:55:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-10 05:55:41,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:55:41,774 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:55:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:55:41,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:55:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:55:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1359232040, now seen corresponding path program 1 times [2024-11-10 05:55:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:55:41,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56628650] [2024-11-10 05:55:41,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:55:41,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:55:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:55:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:42,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:55:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:55:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:55:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:55:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:42,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 05:55:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:55:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:55:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:55:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:55:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:55:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:55:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:55:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:55:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:55:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:55:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:55:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:55:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:55:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:55:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:55:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:55:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:55:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:55:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:55:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:55:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:55:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:55:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:55:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:55:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:55:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:55:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:55:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 05:55:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:55:43,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:55:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56628650] [2024-11-10 05:55:43,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56628650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:55:43,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:55:43,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:55:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103872703] [2024-11-10 05:55:43,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:55:43,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:55:43,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:55:43,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:55:43,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:55:43,102 INFO L87 Difference]: Start difference. First operand 277 states and 433 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:55:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:55:44,065 INFO L93 Difference]: Finished difference Result 621 states and 973 transitions. [2024-11-10 05:55:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 05:55:44,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-11-10 05:55:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:55:44,072 INFO L225 Difference]: With dead ends: 621 [2024-11-10 05:55:44,073 INFO L226 Difference]: Without dead ends: 415 [2024-11-10 05:55:44,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:55:44,078 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 291 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:55:44,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 881 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:55:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-10 05:55:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 385. [2024-11-10 05:55:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 244 states have (on average 1.360655737704918) internal successors, (332), 244 states have internal predecessors, (332), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-10 05:55:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 604 transitions. [2024-11-10 05:55:44,159 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 604 transitions. Word has length 219 [2024-11-10 05:55:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:55:44,160 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 604 transitions. [2024-11-10 05:55:44,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:55:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 604 transitions. [2024-11-10 05:55:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-10 05:55:44,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:55:44,165 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:55:44,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:55:44,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:55:44,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:55:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash 875677462, now seen corresponding path program 1 times [2024-11-10 05:55:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:55:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051061874] [2024-11-10 05:55:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:55:44,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:55:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:55:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:55:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:55:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:55:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:55:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 05:55:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:55:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:55:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:55:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:55:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:55:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:55:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:55:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:55:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:55:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:55:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:55:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:55:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:55:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:55:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:55:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:55:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:55:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:55:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:55:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:55:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:55:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:55:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:55:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:55:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:55:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:55:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:55:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 05:55:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:55:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:55:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051061874] [2024-11-10 05:55:44,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051061874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:55:44,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:55:44,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:55:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119602067] [2024-11-10 05:55:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:55:44,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:55:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:55:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:55:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:55:44,926 INFO L87 Difference]: Start difference. First operand 385 states and 604 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:55:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:55:45,461 INFO L93 Difference]: Finished difference Result 597 states and 932 transitions. [2024-11-10 05:55:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 05:55:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-11-10 05:55:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:55:45,467 INFO L225 Difference]: With dead ends: 597 [2024-11-10 05:55:45,467 INFO L226 Difference]: Without dead ends: 496 [2024-11-10 05:55:45,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:55:45,469 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 234 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:55:45,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 732 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:55:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-10 05:55:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 396. [2024-11-10 05:55:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 255 states have (on average 1.3725490196078431) internal successors, (350), 255 states have internal predecessors, (350), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-10 05:55:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 622 transitions. [2024-11-10 05:55:45,527 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 622 transitions. Word has length 220 [2024-11-10 05:55:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:55:45,527 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 622 transitions. [2024-11-10 05:55:45,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:55:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 622 transitions. [2024-11-10 05:55:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-10 05:55:45,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:55:45,529 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:55:45,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:55:45,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:55:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:55:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1812453628, now seen corresponding path program 1 times [2024-11-10 05:55:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:55:45,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233563050] [2024-11-10 05:55:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:55:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:55:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:55:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:55:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:55:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:55:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:55:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 05:55:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:55:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:55:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:55:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:55:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:55:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:55:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:55:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:55:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:55:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:55:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:55:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:55:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:55:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:55:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:55:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:55:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:55:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:55:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:55:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:55:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:55:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:55:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:55:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:55:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:55:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:55:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:55:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 05:55:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:55:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:55:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:55:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233563050] [2024-11-10 05:55:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233563050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:55:47,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:55:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 05:55:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461522453] [2024-11-10 05:55:47,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:55:47,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:55:47,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:55:47,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:55:47,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:55:47,253 INFO L87 Difference]: Start difference. First operand 396 states and 622 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:55:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:55:48,612 INFO L93 Difference]: Finished difference Result 794 states and 1232 transitions. [2024-11-10 05:55:48,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:55:48,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-11-10 05:55:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:55:48,616 INFO L225 Difference]: With dead ends: 794 [2024-11-10 05:55:48,617 INFO L226 Difference]: Without dead ends: 596 [2024-11-10 05:55:48,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:55:48,619 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 379 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:55:48,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 552 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 05:55:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-10 05:55:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 544. [2024-11-10 05:55:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 347 states have (on average 1.345821325648415) internal successors, (467), 348 states have internal predecessors, (467), 190 states have call successors, (190), 6 states have call predecessors, (190), 6 states have return successors, (190), 189 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 05:55:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 847 transitions. [2024-11-10 05:55:48,724 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 847 transitions. Word has length 220 [2024-11-10 05:55:48,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:55:48,724 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 847 transitions. [2024-11-10 05:55:48,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:55:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 847 transitions. [2024-11-10 05:55:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-10 05:55:48,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:55:48,727 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:55:48,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:55:48,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:55:48,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:55:48,728 INFO L85 PathProgramCache]: Analyzing trace with hash 15502269, now seen corresponding path program 1 times [2024-11-10 05:55:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:55:48,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673587176] [2024-11-10 05:55:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:55:48,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:55:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:57:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:57:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:57:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:57:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:57:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 05:57:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:57:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:57:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:57:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:57:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:57:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:57:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:57:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:57:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:57:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:57:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:57:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:57:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:57:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:57:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:57:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:57:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:57:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:57:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:57:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:57:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:57:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:57:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:57:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:57:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:57:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:57:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:57:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 05:57:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:57:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:57:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673587176] [2024-11-10 05:57:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673587176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:57:04,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:57:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 05:57:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885372017] [2024-11-10 05:57:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:57:04,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 05:57:04,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:57:04,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 05:57:04,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:57:04,535 INFO L87 Difference]: Start difference. First operand 544 states and 847 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:57:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:57:08,796 INFO L93 Difference]: Finished difference Result 902 states and 1397 transitions. [2024-11-10 05:57:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 05:57:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-11-10 05:57:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:57:08,802 INFO L225 Difference]: With dead ends: 902 [2024-11-10 05:57:08,802 INFO L226 Difference]: Without dead ends: 653 [2024-11-10 05:57:08,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-10 05:57:08,804 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 164 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:57:08,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 740 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 05:57:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-10 05:57:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 591. [2024-11-10 05:57:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 394 states have (on average 1.3604060913705585) internal successors, (536), 395 states have internal predecessors, (536), 190 states have call successors, (190), 6 states have call predecessors, (190), 6 states have return successors, (190), 189 states have call predecessors, (190), 190 states have call successors, (190) [2024-11-10 05:57:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 916 transitions. [2024-11-10 05:57:08,865 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 916 transitions. Word has length 220 [2024-11-10 05:57:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:57:08,866 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 916 transitions. [2024-11-10 05:57:08,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:57:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 916 transitions. [2024-11-10 05:57:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-10 05:57:08,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:57:08,868 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:57:08,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:57:08,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:57:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:57:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2061707074, now seen corresponding path program 1 times [2024-11-10 05:57:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:57:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717072812] [2024-11-10 05:57:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:57:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:57:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:57:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:57:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 05:57:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:57:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 05:57:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 05:57:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 05:57:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:57:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:57:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:57:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:57:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:57:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:57:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:57:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:57:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:57:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:57:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:57:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:57:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:57:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:57:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:57:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:57:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:57:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:57:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:57:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:57:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 05:57:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 05:57:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 05:57:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 05:57:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 05:57:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 05:57:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 05:57:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:57:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 05:57:09,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:57:09,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717072812] [2024-11-10 05:57:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717072812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:57:09,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:57:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:57:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185899670] [2024-11-10 05:57:09,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:57:09,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:57:09,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:57:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:57:09,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:57:09,144 INFO L87 Difference]: Start difference. First operand 591 states and 916 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-10 05:57:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:57:09,236 INFO L93 Difference]: Finished difference Result 1062 states and 1647 transitions. [2024-11-10 05:57:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:57:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-11-10 05:57:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:57:09,241 INFO L225 Difference]: With dead ends: 1062 [2024-11-10 05:57:09,241 INFO L226 Difference]: Without dead ends: 612 [2024-11-10 05:57:09,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:57:09,244 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:57:09,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 305 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:57:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states.