./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-26.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 410a9989c425e67a684cc41a030ddcb789719d04c3f66db1da52362a37ac45cb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:02:14,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:02:14,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:02:14,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:02:14,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:02:14,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:02:14,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:02:14,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:02:14,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:02:14,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:02:14,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:02:14,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:02:14,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:02:14,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:02:14,828 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:02:14,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:02:14,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:02:14,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:02:14,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:02:14,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:02:14,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:02:14,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:02:14,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:02:14,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:02:14,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:02:14,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:02:14,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:02:14,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:02:14,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:02:14,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:02:14,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:02:14,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:02:14,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:02:14,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:02:14,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:02:14,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:02:14,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:02:14,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:02:14,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:02:14,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:02:14,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:02:14,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:02:14,841 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 -> 410a9989c425e67a684cc41a030ddcb789719d04c3f66db1da52362a37ac45cb [2024-11-12 06:02:15,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:02:15,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:02:15,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:02:15,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:02:15,159 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:02:15,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-26.i [2024-11-12 06:02:16,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:02:17,042 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:02:17,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-26.i [2024-11-12 06:02:17,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa029a9b7/0cab6e54607c4524b01e899bb7f3871e/FLAG7eb3b0b44 [2024-11-12 06:02:17,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa029a9b7/0cab6e54607c4524b01e899bb7f3871e [2024-11-12 06:02:17,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:02:17,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:02:17,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:02:17,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:02:17,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:02:17,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:17,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78eb153d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17, skipping insertion in model container [2024-11-12 06:02:17,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:17,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:02:17,662 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_operatoramount_amount100_file-26.i[916,929] [2024-11-12 06:02:17,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:02:17,823 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:02:17,839 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_operatoramount_amount100_file-26.i[916,929] [2024-11-12 06:02:17,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:02:17,952 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:02:17,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17 WrapperNode [2024-11-12 06:02:17,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:02:17,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:02:17,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:02:17,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:02:17,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,055 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-11-12 06:02:18,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:02:18,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:02:18,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:02:18,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:02:18,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,106 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-12 06:02:18,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:02:18,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:02:18,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:02:18,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:02:18,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (1/1) ... [2024-11-12 06:02:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:02:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:02:18,204 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-12 06:02:18,207 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-12 06:02:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:02:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:02:18,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:02:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:02:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:02:18,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:02:18,384 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:02:18,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:02:18,926 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-12 06:02:18,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:02:18,945 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:02:18,946 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:02:18,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:02:18 BoogieIcfgContainer [2024-11-12 06:02:18,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:02:18,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:02:18,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:02:18,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:02:18,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:02:17" (1/3) ... [2024-11-12 06:02:18,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e86a913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:02:18, skipping insertion in model container [2024-11-12 06:02:18,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:02:17" (2/3) ... [2024-11-12 06:02:18,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e86a913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:02:18, skipping insertion in model container [2024-11-12 06:02:18,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:02:18" (3/3) ... [2024-11-12 06:02:18,958 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-26.i [2024-11-12 06:02:18,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:02:18,974 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:02:19,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:02:19,066 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;@304858ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:02:19,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:02:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 06:02:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 06:02:19,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:02:19,091 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:02:19,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:02:19,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:02:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash 189627933, now seen corresponding path program 1 times [2024-11-12 06:02:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:02:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380283786] [2024-11-12 06:02:19,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:02:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:02:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:02:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:02:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:02:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:02:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:02:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:02:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:02:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:02:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:02:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:02:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:02:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:02:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:02:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:02:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:02:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:02:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:02:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:02:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:02:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:02:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:02:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:02:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:02:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:02:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:02:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:02:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:02:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:02:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:02:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:02:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 06:02:19,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:02:19,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380283786] [2024-11-12 06:02:19,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380283786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:02:19,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:02:19,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:02:19,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050399879] [2024-11-12 06:02:19,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:02:19,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:02:19,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:02:19,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:02:19,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:02:19,886 INFO L87 Difference]: Start difference. First operand has 102 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-12 06:02:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:02:19,919 INFO L93 Difference]: Finished difference Result 197 states and 342 transitions. [2024-11-12 06:02:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:02:19,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 197 [2024-11-12 06:02:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:02:19,933 INFO L225 Difference]: With dead ends: 197 [2024-11-12 06:02:19,935 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 06:02:19,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-12 06:02:19,947 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:02:19,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:02:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 06:02:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 06:02:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 06:02:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-12 06:02:20,002 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 197 [2024-11-12 06:02:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:02:20,003 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-12 06:02:20,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-12 06:02:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-12 06:02:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 06:02:20,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:02:20,008 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:02:20,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:02:20,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:02:20,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:02:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash 569652249, now seen corresponding path program 1 times [2024-11-12 06:02:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:02:20,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352891783] [2024-11-12 06:02:20,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:02:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:02:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:02:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:02:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:02:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:02:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:02:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:02:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:02:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:02:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:02:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:02:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:02:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:02:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:02:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:02:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:02:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:02:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:02:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:02:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:02:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:02:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:02:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:02:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:02:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:02:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:02:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:02:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:02:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:02:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:02:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:02:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 06:02:20,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:02:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352891783] [2024-11-12 06:02:20,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352891783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:02:20,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:02:20,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:02:20,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52612796] [2024-11-12 06:02:20,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:02:20,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:02:20,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:02:20,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:02:20,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:02:20,796 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-12 06:02:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:02:20,886 INFO L93 Difference]: Finished difference Result 288 states and 450 transitions. [2024-11-12 06:02:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:02:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-11-12 06:02:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:02:20,890 INFO L225 Difference]: With dead ends: 288 [2024-11-12 06:02:20,890 INFO L226 Difference]: Without dead ends: 193 [2024-11-12 06:02:20,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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-12 06:02:20,895 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 146 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:02:20,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 399 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:02:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-12 06:02:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 99. [2024-11-12 06:02:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 06:02:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-11-12 06:02:20,928 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 197 [2024-11-12 06:02:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:02:20,930 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-11-12 06:02:20,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-12 06:02:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-11-12 06:02:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 06:02:20,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:02:20,936 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:02:20,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:02:20,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:02:20,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:02:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash -451416105, now seen corresponding path program 1 times [2024-11-12 06:02:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:02:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671118286] [2024-11-12 06:02:20,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:02:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:02:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:02:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:02:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:02:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:02:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:02:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:02:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:02:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:02:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:02:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:02:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:02:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:02:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:02:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:02:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:02:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:02:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:02:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:02:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:02:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:02:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:02:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:02:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:02:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:02:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:02:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:02:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:02:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:02:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:02:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:02:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 06:02:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:02:22,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671118286] [2024-11-12 06:02:22,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671118286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:02:22,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:02:22,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:02:22,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687069531] [2024-11-12 06:02:22,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:02:22,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:02:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:02:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:02:22,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:02:22,120 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-12 06:02:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:02:22,399 INFO L93 Difference]: Finished difference Result 301 states and 459 transitions. [2024-11-12 06:02:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:02:22,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-11-12 06:02:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:02:22,403 INFO L225 Difference]: With dead ends: 301 [2024-11-12 06:02:22,403 INFO L226 Difference]: Without dead ends: 205 [2024-11-12 06:02:22,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:02:22,409 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 180 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:02:22,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 487 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:02:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-12 06:02:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 170. [2024-11-12 06:02:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 131 states have (on average 1.4427480916030535) internal successors, (189), 132 states have internal predecessors, (189), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:02:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 261 transitions. [2024-11-12 06:02:22,437 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 261 transitions. Word has length 197 [2024-11-12 06:02:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:02:22,438 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 261 transitions. [2024-11-12 06:02:22,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-12 06:02:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 261 transitions. [2024-11-12 06:02:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 06:02:22,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:02:22,444 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:02:22,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:02:22,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:02:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:02:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 874043826, now seen corresponding path program 1 times [2024-11-12 06:02:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:02:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647970700] [2024-11-12 06:02:22,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:02:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:02:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:02:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:02:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:02:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:02:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:02:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:02:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:02:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:02:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:02:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:02:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:02:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:02:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:02:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:02:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:02:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:02:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:02:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:02:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:02:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:02:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:02:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:02:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:02:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:02:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:02:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:02:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:02:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:02:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:02:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:02:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 06:02:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:02:23,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647970700] [2024-11-12 06:02:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647970700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:02:23,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:02:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:02:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904063559] [2024-11-12 06:02:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:02:23,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:02:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:02:23,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:02:23,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:02:23,027 INFO L87 Difference]: Start difference. First operand 170 states and 261 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-12 06:02:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:02:23,303 INFO L93 Difference]: Finished difference Result 558 states and 858 transitions. [2024-11-12 06:02:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:02:23,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-12 06:02:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:02:23,308 INFO L225 Difference]: With dead ends: 558 [2024-11-12 06:02:23,309 INFO L226 Difference]: Without dead ends: 391 [2024-11-12 06:02:23,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:02:23,311 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 157 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:02:23,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 598 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:02:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-12 06:02:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 318. [2024-11-12 06:02:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 241 states have (on average 1.4398340248962656) internal successors, (347), 243 states have internal predecessors, (347), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 06:02:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 491 transitions. [2024-11-12 06:02:23,371 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 491 transitions. Word has length 198 [2024-11-12 06:02:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:02:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 491 transitions. [2024-11-12 06:02:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-12 06:02:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 491 transitions. [2024-11-12 06:02:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 06:02:23,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:02:23,374 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:02:23,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:02:23,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:02:23,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:02:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1014592436, now seen corresponding path program 1 times [2024-11-12 06:02:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:02:23,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074370208] [2024-11-12 06:02:23,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:02:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:02:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:02:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:02:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:02:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:02:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:02:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:02:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:02:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:02:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:02:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:02:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:02:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:02:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:02:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:02:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:02:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:02:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:02:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:02:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:02:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:02:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:02:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:02:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:02:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:02:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:02:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:02:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:02:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:02:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:24,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:02:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:24,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:02:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 06:02:24,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:02:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074370208] [2024-11-12 06:02:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074370208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:02:24,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:02:24,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:02:24,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801735760] [2024-11-12 06:02:24,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:02:24,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:02:24,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:02:24,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:02:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:02:24,022 INFO L87 Difference]: Start difference. First operand 318 states and 491 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-12 06:02:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:02:24,341 INFO L93 Difference]: Finished difference Result 800 states and 1237 transitions. [2024-11-12 06:02:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:02:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2024-11-12 06:02:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:02:24,349 INFO L225 Difference]: With dead ends: 800 [2024-11-12 06:02:24,350 INFO L226 Difference]: Without dead ends: 485 [2024-11-12 06:02:24,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:02:24,352 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 253 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:02:24,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 462 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:02:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-12 06:02:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 483. [2024-11-12 06:02:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 368 states have (on average 1.4320652173913044) internal successors, (527), 371 states have internal predecessors, (527), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 06:02:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 743 transitions. [2024-11-12 06:02:24,407 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 743 transitions. Word has length 198 [2024-11-12 06:02:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:02:24,408 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 743 transitions. [2024-11-12 06:02:24,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-12 06:02:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 743 transitions. [2024-11-12 06:02:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 06:02:24,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:02:24,411 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:02:24,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:02:24,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:02:24,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:02:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash 196943986, now seen corresponding path program 1 times [2024-11-12 06:02:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:02:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421535303] [2024-11-12 06:02:24,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:02:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:02:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:02:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:02:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:02:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:02:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:02:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:02:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:02:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:02:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:02:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:02:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:02:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:02:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:02:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:02:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:02:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:02:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:02:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:02:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:02:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:02:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:02:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:02:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:02:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:02:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:02:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:02:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:02:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:02:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:02:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:02:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 06:02:36,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:02:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421535303] [2024-11-12 06:02:36,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421535303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:02:36,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:02:36,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 06:02:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343336214] [2024-11-12 06:02:36,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:02:36,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 06:02:36,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:02:36,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 06:02:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 06:02:36,940 INFO L87 Difference]: Start difference. First operand 483 states and 743 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-12 06:02:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:02:40,400 INFO L93 Difference]: Finished difference Result 1748 states and 2639 transitions. [2024-11-12 06:02:40,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 06:02:40,401 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 198 [2024-11-12 06:02:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:02:40,410 INFO L225 Difference]: With dead ends: 1748 [2024-11-12 06:02:40,410 INFO L226 Difference]: Without dead ends: 1268 [2024-11-12 06:02:40,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-11-12 06:02:40,414 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 759 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:02:40,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 960 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 06:02:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-11-12 06:02:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 985. [2024-11-12 06:02:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 774 states have (on average 1.4405684754521964) internal successors, (1115), 783 states have internal predecessors, (1115), 196 states have call successors, (196), 14 states have call predecessors, (196), 14 states have return successors, (196), 187 states have call predecessors, (196), 196 states have call successors, (196) [2024-11-12 06:02:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1507 transitions. [2024-11-12 06:02:40,507 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1507 transitions. Word has length 198 [2024-11-12 06:02:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:02:40,508 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1507 transitions. [2024-11-12 06:02:40,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-12 06:02:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1507 transitions. [2024-11-12 06:02:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 06:02:40,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:02:40,511 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:02:40,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:02:40,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:02:40,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:02:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash -814173264, now seen corresponding path program 1 times [2024-11-12 06:02:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:02:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827718763] [2024-11-12 06:02:40,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:02:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:02:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:02:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:02:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:02:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:02:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:02:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:02:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:02:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:02:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:02:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:02:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:02:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:02:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:02:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:02:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:02:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:02:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:02:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:02:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:02:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:02:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 06:02:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:02:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 06:02:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 06:02:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 06:02:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:02:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:02:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:02:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:02:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:02:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:02:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 06:02:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:02:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827718763] [2024-11-12 06:02:41,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827718763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:02:41,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:02:41,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 06:02:41,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560156127] [2024-11-12 06:02:41,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:02:41,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 06:02:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:02:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 06:02:41,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:02:41,292 INFO L87 Difference]: Start difference. First operand 985 states and 1507 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-12 06:02:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:02:42,441 INFO L93 Difference]: Finished difference Result 2525 states and 3857 transitions. [2024-11-12 06:02:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 06:02:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2024-11-12 06:02:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:02:42,451 INFO L225 Difference]: With dead ends: 2525 [2024-11-12 06:02:42,451 INFO L226 Difference]: Without dead ends: 1543 [2024-11-12 06:02:42,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-12 06:02:42,455 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 432 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 06:02:42,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 943 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 06:02:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-11-12 06:02:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1487. [2024-11-12 06:02:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1180 states have (on average 1.4330508474576271) internal successors, (1691), 1195 states have internal predecessors, (1691), 284 states have call successors, (284), 22 states have call predecessors, (284), 22 states have return successors, (284), 269 states have call predecessors, (284), 284 states have call successors, (284) [2024-11-12 06:02:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2259 transitions. [2024-11-12 06:02:42,570 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2259 transitions. Word has length 198 [2024-11-12 06:02:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:02:42,571 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2259 transitions. [2024-11-12 06:02:42,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-12 06:02:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2259 transitions. [2024-11-12 06:02:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 06:02:42,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:02:42,574 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:02:42,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 06:02:42,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:02:42,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:02:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash -134114894, now seen corresponding path program 1 times [2024-11-12 06:02:42,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:02:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697819162] [2024-11-12 06:02:42,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:02:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:02:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat