./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_variablewrapping_wrapper-s_file-43.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 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:02:55,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:02:55,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:02:55,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:02:55,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:02:55,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:02:55,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:02:55,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:02:55,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:02:55,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:02:55,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:02:55,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:02:55,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:02:55,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:02:55,281 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:02:55,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:02:55,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:02:55,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:02:55,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:02:55,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:02:55,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:02:55,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:02:55,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:02:55,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:02:55,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:02:55,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:02:55,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:02:55,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:02:55,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:02:55,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:02:55,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:02:55,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:02:55,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:02:55,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:02:55,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:02:55,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:02:55,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:02:55,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:02:55,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:02:55,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:02:55,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:02:55,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:02:55,289 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 -> 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 [2024-11-09 02:02:55,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:02:55,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:02:55,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:02:55,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:02:55,612 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:02:55,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-09 02:02:57,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:02:57,330 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:02:57,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-09 02:02:57,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8befb52/2257ad3d86a3412e8f9c73c3575370a6/FLAG219615987 [2024-11-09 02:02:57,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8befb52/2257ad3d86a3412e8f9c73c3575370a6 [2024-11-09 02:02:57,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:02:57,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:02:57,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:02:57,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:02:57,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:02:57,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:02:57" (1/1) ... [2024-11-09 02:02:57,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4d8c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:57, skipping insertion in model container [2024-11-09 02:02:57,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:02:57" (1/1) ... [2024-11-09 02:02:57,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:02:57,984 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_variablewrapping_wrapper-s_file-43.i[916,929] [2024-11-09 02:02:58,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:02:58,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:02:58,098 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_variablewrapping_wrapper-s_file-43.i[916,929] [2024-11-09 02:02:58,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:02:58,188 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:02:58,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58 WrapperNode [2024-11-09 02:02:58,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:02:58,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:02:58,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:02:58,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:02:58,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,281 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 541 [2024-11-09 02:02:58,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:02:58,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:02:58,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:02:58,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:02:58,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,318 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:02:58,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:02:58,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:02:58,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:02:58,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:02:58,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (1/1) ... [2024-11-09 02:02:58,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:02:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:02:58,421 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-09 02:02:58,423 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-09 02:02:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:02:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:02:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:02:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:02:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:02:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:02:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:02:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:02:58,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:02:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:02:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:02:58,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:02:58,576 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:02:58,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:02:59,256 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-09 02:02:59,256 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:02:59,277 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:02:59,277 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:02:59,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:59 BoogieIcfgContainer [2024-11-09 02:02:59,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:02:59,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:02:59,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:02:59,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:02:59,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:02:57" (1/3) ... [2024-11-09 02:02:59,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bf1e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:02:59, skipping insertion in model container [2024-11-09 02:02:59,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:58" (2/3) ... [2024-11-09 02:02:59,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bf1e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:02:59, skipping insertion in model container [2024-11-09 02:02:59,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:59" (3/3) ... [2024-11-09 02:02:59,287 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-43.i [2024-11-09 02:02:59,304 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:02:59,304 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:02:59,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:02:59,388 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;@3d9a6239, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:02:59,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:02:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:02:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 02:02:59,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:59,407 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:02:59,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:59,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2025586780, now seen corresponding path program 1 times [2024-11-09 02:02:59,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:59,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827372800] [2024-11-09 02:02:59,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:02:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:02:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:02:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:02:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:02:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:02:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:02:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:02:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:02:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:02:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:02:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:02:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:59,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:02:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:00,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:00,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827372800] [2024-11-09 02:03:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827372800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:00,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:03:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945775083] [2024-11-09 02:03:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:00,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:03:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:03:00,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:03:00,076 INFO L87 Difference]: Start difference. First operand has 126 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:00,148 INFO L93 Difference]: Finished difference Result 245 states and 388 transitions. [2024-11-09 02:03:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:03:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-09 02:03:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:00,169 INFO L225 Difference]: With dead ends: 245 [2024-11-09 02:03:00,172 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 02:03:00,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-09 02:03:00,199 INFO L432 NwaCegarLoop]: 180 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, 180 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-09 02:03:00,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:03:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 02:03:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 02:03:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-09 02:03:00,258 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 168 [2024-11-09 02:03:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:00,258 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-09 02:03:00,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-09 02:03:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 02:03:00,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:00,263 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:00,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:03:00,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:00,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 176494844, now seen corresponding path program 1 times [2024-11-09 02:03:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578562093] [2024-11-09 02:03:00,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:00,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578562093] [2024-11-09 02:03:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578562093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:03:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351842988] [2024-11-09 02:03:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:00,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:03:00,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:00,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:03:00,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:03:00,780 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:00,852 INFO L93 Difference]: Finished difference Result 243 states and 360 transitions. [2024-11-09 02:03:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:03:00,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-09 02:03:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:00,855 INFO L225 Difference]: With dead ends: 243 [2024-11-09 02:03:00,855 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 02:03:00,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:03:00,860 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:00,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:03:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 02:03:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 02:03:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-09 02:03:00,880 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 168 [2024-11-09 02:03:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:00,882 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-09 02:03:00,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-09 02:03:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 02:03:00,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:00,889 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:00,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:03:00,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:00,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:00,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1720484614, now seen corresponding path program 1 times [2024-11-09 02:03:00,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:00,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240159567] [2024-11-09 02:03:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:00,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:01,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:01,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240159567] [2024-11-09 02:03:01,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240159567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:01,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:01,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:03:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951382395] [2024-11-09 02:03:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:01,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:03:01,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:01,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:03:01,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:03:01,252 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:01,311 INFO L93 Difference]: Finished difference Result 248 states and 365 transitions. [2024-11-09 02:03:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:03:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-09 02:03:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:01,314 INFO L225 Difference]: With dead ends: 248 [2024-11-09 02:03:01,314 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 02:03:01,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:03:01,319 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:01,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:03:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 02:03:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-09 02:03:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-11-09 02:03:01,334 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 168 [2024-11-09 02:03:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:01,337 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-11-09 02:03:01,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-11-09 02:03:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 02:03:01,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:01,341 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:01,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:03:01,341 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:01,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1040426244, now seen corresponding path program 1 times [2024-11-09 02:03:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:01,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122546956] [2024-11-09 02:03:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:01,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:01,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122546956] [2024-11-09 02:03:01,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122546956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:03:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684993477] [2024-11-09 02:03:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:03:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:03:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:03:01,615 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:01,650 INFO L93 Difference]: Finished difference Result 252 states and 369 transitions. [2024-11-09 02:03:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:03:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-09 02:03:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:01,653 INFO L225 Difference]: With dead ends: 252 [2024-11-09 02:03:01,656 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 02:03:01,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:03:01,658 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:01,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 521 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:03:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 02:03:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-09 02:03:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-09 02:03:01,674 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 168 [2024-11-09 02:03:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:01,677 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-09 02:03:01,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-09 02:03:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 02:03:01,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:01,679 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:01,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:03:01,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:01,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:01,681 INFO L85 PathProgramCache]: Analyzing trace with hash 734581118, now seen corresponding path program 1 times [2024-11-09 02:03:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:01,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832845982] [2024-11-09 02:03:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:01,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832845982] [2024-11-09 02:03:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832845982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:03:01,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823591681] [2024-11-09 02:03:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:01,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:03:01,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:01,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:03:01,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:03:01,927 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:01,961 INFO L93 Difference]: Finished difference Result 256 states and 373 transitions. [2024-11-09 02:03:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:03:01,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-09 02:03:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:01,966 INFO L225 Difference]: With dead ends: 256 [2024-11-09 02:03:01,966 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 02:03:01,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:03:01,969 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:01,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:03:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 02:03:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-09 02:03:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2024-11-09 02:03:01,986 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 168 [2024-11-09 02:03:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:01,987 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2024-11-09 02:03:01,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2024-11-09 02:03:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 02:03:01,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:01,990 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:01,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:03:01,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:01,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash 736428160, now seen corresponding path program 1 times [2024-11-09 02:03:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471327789] [2024-11-09 02:03:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:02,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:02,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471327789] [2024-11-09 02:03:02,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471327789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:02,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:02,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:03:02,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349458316] [2024-11-09 02:03:02,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:02,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:03:02,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:02,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:03:02,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:02,757 INFO L87 Difference]: Start difference. First operand 130 states and 188 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:03,192 INFO L93 Difference]: Finished difference Result 371 states and 535 transitions. [2024-11-09 02:03:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:03:03,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 168 [2024-11-09 02:03:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:03,196 INFO L225 Difference]: With dead ends: 371 [2024-11-09 02:03:03,197 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 02:03:03,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:03:03,199 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 136 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:03,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1005 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:03:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 02:03:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 138. [2024-11-09 02:03:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2024-11-09 02:03:03,220 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 168 [2024-11-09 02:03:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:03,220 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2024-11-09 02:03:03,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-11-09 02:03:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 02:03:03,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:03,226 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:03,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:03:03,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -284640194, now seen corresponding path program 1 times [2024-11-09 02:03:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:03,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978786687] [2024-11-09 02:03:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:04,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:04,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978786687] [2024-11-09 02:03:04,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978786687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:04,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:04,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:03:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466971418] [2024-11-09 02:03:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:04,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:03:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:03:04,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:04,250 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:04,883 INFO L93 Difference]: Finished difference Result 378 states and 544 transitions. [2024-11-09 02:03:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:03:04,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2024-11-09 02:03:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:04,886 INFO L225 Difference]: With dead ends: 378 [2024-11-09 02:03:04,887 INFO L226 Difference]: Without dead ends: 243 [2024-11-09 02:03:04,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:03:04,888 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 225 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:04,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 696 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:03:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-09 02:03:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 138. [2024-11-09 02:03:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 198 transitions. [2024-11-09 02:03:04,896 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 198 transitions. Word has length 168 [2024-11-09 02:03:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:04,896 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 198 transitions. [2024-11-09 02:03:04,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 198 transitions. [2024-11-09 02:03:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 02:03:04,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:04,898 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:04,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:03:04,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:04,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1058318679, now seen corresponding path program 1 times [2024-11-09 02:03:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:04,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788045182] [2024-11-09 02:03:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:04,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 02:03:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788045182] [2024-11-09 02:03:06,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788045182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:03:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854533451] [2024-11-09 02:03:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:06,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:03:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:03:06,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:03:06,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:03:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:06,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 02:03:06,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:06,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:06,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:07,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:07,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:07,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:07,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:07,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:07,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:07,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2024-11-09 02:03:07,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:07,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 13 [2024-11-09 02:03:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-09 02:03:07,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:03:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 02:03:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854533451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:03:07,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:03:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-11-09 02:03:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219165657] [2024-11-09 02:03:07,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:03:07,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:03:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:03:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:03:07,613 INFO L87 Difference]: Start difference. First operand 138 states and 198 transitions. Second operand has 17 states, 14 states have (on average 10.285714285714286) internal successors, (144), 17 states have internal predecessors, (144), 8 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 5 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-09 02:03:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:09,030 INFO L93 Difference]: Finished difference Result 315 states and 449 transitions. [2024-11-09 02:03:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:03:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.285714285714286) internal successors, (144), 17 states have internal predecessors, (144), 8 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 5 states have call predecessors, (56), 8 states have call successors, (56) Word has length 168 [2024-11-09 02:03:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:09,032 INFO L225 Difference]: With dead ends: 315 [2024-11-09 02:03:09,032 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 02:03:09,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2024-11-09 02:03:09,034 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 503 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:09,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 622 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:03:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 02:03:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-11-09 02:03:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 149 states have (on average 1.3557046979865772) internal successors, (202), 150 states have internal predecessors, (202), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 02:03:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2024-11-09 02:03:09,044 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 168 [2024-11-09 02:03:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:09,045 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2024-11-09 02:03:09,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.285714285714286) internal successors, (144), 17 states have internal predecessors, (144), 8 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 5 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-09 02:03:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2024-11-09 02:03:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:09,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:09,047 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:09,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:03:09,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:03:09,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash 39089738, now seen corresponding path program 1 times [2024-11-09 02:03:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708703769] [2024-11-09 02:03:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 02:03:10,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:10,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708703769] [2024-11-09 02:03:10,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708703769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:03:10,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768719918] [2024-11-09 02:03:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:10,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:03:10,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:03:10,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:03:10,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:03:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:10,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 02:03:10,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:10,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:11,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:11,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:11,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:11,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:11,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:11,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:03:11,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:11,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2024-11-09 02:03:11,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:11,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 13 [2024-11-09 02:03:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-09 02:03:11,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:03:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 02:03:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768719918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:03:11,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:03:11,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2024-11-09 02:03:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017699319] [2024-11-09 02:03:11,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:03:11,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 02:03:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:11,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 02:03:11,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:03:11,583 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand has 20 states, 18 states have (on average 6.333333333333333) internal successors, (114), 20 states have internal predecessors, (114), 5 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-09 02:03:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:12,885 INFO L93 Difference]: Finished difference Result 325 states and 456 transitions. [2024-11-09 02:03:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:03:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.333333333333333) internal successors, (114), 20 states have internal predecessors, (114), 5 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 5 states have call successors, (51) Word has length 169 [2024-11-09 02:03:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:12,887 INFO L225 Difference]: With dead ends: 325 [2024-11-09 02:03:12,888 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 02:03:12,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2024-11-09 02:03:12,889 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 258 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:12,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 958 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:03:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 02:03:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-11-09 02:03:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 152 states have internal predecessors, (204), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 02:03:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 252 transitions. [2024-11-09 02:03:12,900 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 252 transitions. Word has length 169 [2024-11-09 02:03:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:12,901 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 252 transitions. [2024-11-09 02:03:12,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.333333333333333) internal successors, (114), 20 states have internal predecessors, (114), 5 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-09 02:03:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 252 transitions. [2024-11-09 02:03:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:12,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:12,903 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:12,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 02:03:13,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 02:03:13,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:13,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash 179638348, now seen corresponding path program 1 times [2024-11-09 02:03:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:13,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840585556] [2024-11-09 02:03:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 02:03:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840585556] [2024-11-09 02:03:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840585556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:13,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:03:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146459170] [2024-11-09 02:03:13,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:13,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:03:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:13,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:03:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:03:13,626 INFO L87 Difference]: Start difference. First operand 179 states and 252 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:14,327 INFO L93 Difference]: Finished difference Result 324 states and 451 transitions. [2024-11-09 02:03:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 02:03:14,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-09 02:03:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:14,332 INFO L225 Difference]: With dead ends: 324 [2024-11-09 02:03:14,332 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 02:03:14,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:03:14,333 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 233 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:14,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 406 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:03:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 02:03:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2024-11-09 02:03:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 147 states have internal predecessors, (196), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 02:03:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 244 transitions. [2024-11-09 02:03:14,350 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 244 transitions. Word has length 169 [2024-11-09 02:03:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 244 transitions. [2024-11-09 02:03:14,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 244 transitions. [2024-11-09 02:03:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:14,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:14,371 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:03:14,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:14,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash 280449655, now seen corresponding path program 1 times [2024-11-09 02:03:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:14,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569228232] [2024-11-09 02:03:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569228232] [2024-11-09 02:03:15,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569228232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:15,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:15,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:03:15,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755942756] [2024-11-09 02:03:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:15,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:03:15,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:03:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:15,108 INFO L87 Difference]: Start difference. First operand 175 states and 244 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:15,637 INFO L93 Difference]: Finished difference Result 439 states and 605 transitions. [2024-11-09 02:03:15,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:03:15,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-09 02:03:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:15,641 INFO L225 Difference]: With dead ends: 439 [2024-11-09 02:03:15,642 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 02:03:15,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:03:15,644 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 229 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:15,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 432 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:03:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 02:03:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 286. [2024-11-09 02:03:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 236 states have (on average 1.3305084745762712) internal successors, (314), 238 states have internal predecessors, (314), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 02:03:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 398 transitions. [2024-11-09 02:03:15,670 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 398 transitions. Word has length 169 [2024-11-09 02:03:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:15,671 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 398 transitions. [2024-11-09 02:03:15,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 398 transitions. [2024-11-09 02:03:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:15,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:15,673 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:15,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:03:15,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:15,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:15,674 INFO L85 PathProgramCache]: Analyzing trace with hash -740618699, now seen corresponding path program 1 times [2024-11-09 02:03:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:15,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355333217] [2024-11-09 02:03:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:15,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:17,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355333217] [2024-11-09 02:03:17,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355333217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:17,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:17,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:03:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135150647] [2024-11-09 02:03:17,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:17,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:03:17,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:17,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:03:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:03:17,577 INFO L87 Difference]: Start difference. First operand 286 states and 398 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:18,306 INFO L93 Difference]: Finished difference Result 972 states and 1343 transitions. [2024-11-09 02:03:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:03:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-09 02:03:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:18,312 INFO L225 Difference]: With dead ends: 972 [2024-11-09 02:03:18,312 INFO L226 Difference]: Without dead ends: 720 [2024-11-09 02:03:18,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:03:18,314 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 309 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:18,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 940 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:03:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-09 02:03:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 499. [2024-11-09 02:03:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 406 states have (on average 1.3152709359605912) internal successors, (534), 407 states have internal predecessors, (534), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-09 02:03:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 690 transitions. [2024-11-09 02:03:18,365 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 690 transitions. Word has length 169 [2024-11-09 02:03:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:18,366 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 690 transitions. [2024-11-09 02:03:18,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 690 transitions. [2024-11-09 02:03:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:18,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:18,369 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:18,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:03:18,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:18,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash 602340174, now seen corresponding path program 1 times [2024-11-09 02:03:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:18,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573246617] [2024-11-09 02:03:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:18,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:18,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:18,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:18,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:18,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:19,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:19,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573246617] [2024-11-09 02:03:19,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573246617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:19,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:03:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454014018] [2024-11-09 02:03:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:19,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:03:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:03:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:19,025 INFO L87 Difference]: Start difference. First operand 499 states and 690 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:19,601 INFO L93 Difference]: Finished difference Result 1174 states and 1612 transitions. [2024-11-09 02:03:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:03:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-09 02:03:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:19,609 INFO L225 Difference]: With dead ends: 1174 [2024-11-09 02:03:19,609 INFO L226 Difference]: Without dead ends: 745 [2024-11-09 02:03:19,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:03:19,611 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:19,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 541 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:03:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-09 02:03:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 501. [2024-11-09 02:03:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 408 states have (on average 1.3137254901960784) internal successors, (536), 409 states have internal predecessors, (536), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-09 02:03:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 692 transitions. [2024-11-09 02:03:19,661 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 692 transitions. Word has length 169 [2024-11-09 02:03:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:19,662 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 692 transitions. [2024-11-09 02:03:19,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 692 transitions. [2024-11-09 02:03:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:19,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:19,666 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:19,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:03:19,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:19,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash -418728180, now seen corresponding path program 1 times [2024-11-09 02:03:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:19,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117935134] [2024-11-09 02:03:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:19,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117935134] [2024-11-09 02:03:19,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117935134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:19,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:19,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:03:19,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918620530] [2024-11-09 02:03:19,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:19,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:03:19,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:03:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:03:19,874 INFO L87 Difference]: Start difference. First operand 501 states and 692 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:19,919 INFO L93 Difference]: Finished difference Result 941 states and 1298 transitions. [2024-11-09 02:03:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:03:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-09 02:03:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:19,923 INFO L225 Difference]: With dead ends: 941 [2024-11-09 02:03:19,923 INFO L226 Difference]: Without dead ends: 510 [2024-11-09 02:03:19,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:03:19,925 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:19,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:03:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-11-09 02:03:19,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2024-11-09 02:03:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 415 states have (on average 1.308433734939759) internal successors, (543), 416 states have internal predecessors, (543), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-09 02:03:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 699 transitions. [2024-11-09 02:03:19,963 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 699 transitions. Word has length 169 [2024-11-09 02:03:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:19,965 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 699 transitions. [2024-11-09 02:03:19,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 699 transitions. [2024-11-09 02:03:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:19,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:19,967 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:19,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:03:19,968 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:19,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1586488949, now seen corresponding path program 1 times [2024-11-09 02:03:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:19,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530756500] [2024-11-09 02:03:19,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:19,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 02:03:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:20,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530756500] [2024-11-09 02:03:20,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530756500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:20,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:20,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:03:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997282706] [2024-11-09 02:03:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:20,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:03:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:03:20,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:03:20,602 INFO L87 Difference]: Start difference. First operand 508 states and 699 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:21,398 INFO L93 Difference]: Finished difference Result 960 states and 1314 transitions. [2024-11-09 02:03:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 02:03:21,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-09 02:03:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:21,402 INFO L225 Difference]: With dead ends: 960 [2024-11-09 02:03:21,403 INFO L226 Difference]: Without dead ends: 522 [2024-11-09 02:03:21,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:03:21,406 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 339 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:21,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 401 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:03:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-09 02:03:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 508. [2024-11-09 02:03:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 415 states have (on average 1.3012048192771084) internal successors, (540), 416 states have internal predecessors, (540), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-09 02:03:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 696 transitions. [2024-11-09 02:03:21,442 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 696 transitions. Word has length 169 [2024-11-09 02:03:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:21,444 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 696 transitions. [2024-11-09 02:03:21,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 696 transitions. [2024-11-09 02:03:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:21,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:21,446 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:21,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:03:21,446 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:21,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2009190775, now seen corresponding path program 1 times [2024-11-09 02:03:21,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:21,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934721961] [2024-11-09 02:03:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:21,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:03:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:03:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:03:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:03:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:03:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:03:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:03:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:03:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:03:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:03:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:03:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:03:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:03:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:03:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:03:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:03:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:03:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:03:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 02:03:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 02:03:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:03:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934721961] [2024-11-09 02:03:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934721961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:03:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714525945] [2024-11-09 02:03:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:03:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:03:21,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:03:21,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:21,977 INFO L87 Difference]: Start difference. First operand 508 states and 696 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:22,656 INFO L93 Difference]: Finished difference Result 1179 states and 1607 transitions. [2024-11-09 02:03:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:03:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-09 02:03:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:22,663 INFO L225 Difference]: With dead ends: 1179 [2024-11-09 02:03:22,663 INFO L226 Difference]: Without dead ends: 741 [2024-11-09 02:03:22,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:03:22,667 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 229 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:22,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 476 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:03:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-09 02:03:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 505. [2024-11-09 02:03:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 412 states have (on average 1.296116504854369) internal successors, (534), 413 states have internal predecessors, (534), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-09 02:03:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 690 transitions. [2024-11-09 02:03:22,707 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 690 transitions. Word has length 169 [2024-11-09 02:03:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:22,707 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 690 transitions. [2024-11-09 02:03:22,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 690 transitions. [2024-11-09 02:03:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:22,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:22,709 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:22,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:03:22,710 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:22,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash 988122421, now seen corresponding path program 1 times [2024-11-09 02:03:22,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:03:22,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890545440] [2024-11-09 02:03:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:03:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 02:03:22,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052468765] [2024-11-09 02:03:22,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:22,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:03:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:03:22,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:03:22,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 02:03:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:03:24,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:03:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:03:25,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:03:25,805 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:03:25,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:03:25,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 02:03:26,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:03:26,012 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:03:26,085 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:03:26,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:03:26 BoogieIcfgContainer [2024-11-09 02:03:26,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:03:26,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:03:26,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:03:26,090 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:03:26,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:59" (3/4) ... [2024-11-09 02:03:26,093 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:03:26,095 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:03:26,096 INFO L158 Benchmark]: Toolchain (without parser) took 28379.13ms. Allocated memory was 130.0MB in the beginning and 664.8MB in the end (delta: 534.8MB). Free memory was 59.2MB in the beginning and 556.5MB in the end (delta: -497.3MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-09 02:03:26,098 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 130.0MB. Free memory was 92.2MB in the beginning and 92.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:03:26,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.28ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 58.9MB in the beginning and 134.9MB in the end (delta: -76.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-09 02:03:26,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.04ms. Allocated memory is still 178.3MB. Free memory was 134.9MB in the beginning and 129.9MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:03:26,104 INFO L158 Benchmark]: Boogie Preprocessor took 99.66ms. Allocated memory is still 178.3MB. Free memory was 129.9MB in the beginning and 125.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:03:26,104 INFO L158 Benchmark]: RCFGBuilder took 894.12ms. Allocated memory is still 178.3MB. Free memory was 125.7MB in the beginning and 88.8MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 02:03:26,105 INFO L158 Benchmark]: TraceAbstraction took 26809.02ms. Allocated memory was 178.3MB in the beginning and 664.8MB in the end (delta: 486.5MB). Free memory was 88.0MB in the beginning and 556.5MB in the end (delta: -468.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-09 02:03:26,105 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 664.8MB. Free memory is still 556.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:03:26,106 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 130.0MB. Free memory was 92.2MB in the beginning and 92.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.28ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 58.9MB in the beginning and 134.9MB in the end (delta: -76.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.04ms. Allocated memory is still 178.3MB. Free memory was 134.9MB in the beginning and 129.9MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.66ms. Allocated memory is still 178.3MB. Free memory was 129.9MB in the beginning and 125.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 894.12ms. Allocated memory is still 178.3MB. Free memory was 125.7MB in the beginning and 88.8MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26809.02ms. Allocated memory was 178.3MB in the beginning and 664.8MB in the end (delta: 486.5MB). Free memory was 88.0MB in the beginning and 556.5MB in the end (delta: -468.6MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 664.8MB. Free memory is still 556.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 131. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 64, 4.5, 64.8, 64.4, 0.2, 10000, 1, 50, 8, 2, 100, 128, 23647, 32, 0, -50, 0, 0 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_4 [L100] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_4 [L100] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L104] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L107] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L113] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L121] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] WrapperStruct00.var_1_21 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L139] RET updateVariables() [L140] CALL step() [L66] EXPR WrapperStruct00.var_1_19 [L66] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L67] EXPR WrapperStruct00.var_1_21 [L67] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L68] EXPR WrapperStruct00.var_1_18 [L68] signed char stepLocal_1 = WrapperStruct00.var_1_18; [L69] EXPR WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_7 [L69] signed long int stepLocal_0 = WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7; [L70] EXPR WrapperStruct00.var_1_8 [L70] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_1=0] [L70] EXPR WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_1=0] [L70] COND FALSE !(stepLocal_1 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) [L77] EXPR WrapperStruct00.var_1_7 [L77] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L77] EXPR WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L77] signed long int stepLocal_2 = WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18; [L78] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_2=10001] [L78] COND FALSE !(WrapperStruct00.var_1_14 >= stepLocal_2) [L81] EXPR WrapperStruct00.var_1_2 [L81] EXPR WrapperStruct00.var_1_3 [L81] EXPR WrapperStruct00.var_1_4 [L81] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L81] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L81] EXPR WrapperStruct00.var_1_3 [L81] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L81] COND TRUE WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) [L82] WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L82] COND FALSE !(WrapperStruct00.var_1_20) [L92] EXPR WrapperStruct00.var_1_1 [L92] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_1 [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR WrapperStruct00.var_1_3 [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L131] EXPR WrapperStruct00.var_1_3 [L131] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13))) [L131] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)) [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_13 [L131] EXPR WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131-L132] return ((((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2611 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2597 mSDsluCounter, 9434 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6912 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5242 IncrementalHoareTripleChecker+Invalid, 5922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 2522 mSDtfsCounter, 5242 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1527 GetRequests, 1389 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=14, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 953 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 3371 NumberOfCodeBlocks, 3371 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3350 ConstructedInterpolants, 0 QuantifiedInterpolants, 7997 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1253 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 14930/15200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:03:26,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_variablewrapping_wrapper-s_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:03:28,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:03:28,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:03:28,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:03:28,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:03:28,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:03:28,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:03:28,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:03:28,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:03:28,586 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:03:28,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:03:28,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:03:28,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:03:28,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:03:28,588 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:03:28,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:03:28,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:03:28,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:03:28,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:03:28,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:03:28,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:03:28,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:03:28,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:03:28,594 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:03:28,594 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:03:28,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:03:28,595 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:03:28,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:03:28,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:03:28,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:03:28,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:03:28,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:03:28,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:03:28,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:03:28,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:03:28,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:03:28,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:03:28,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:03:28,599 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:03:28,599 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:03:28,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:03:28,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:03:28,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:03:28,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:03:28,601 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 -> 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 [2024-11-09 02:03:28,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:03:29,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:03:29,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:03:29,006 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:03:29,006 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:03:29,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-09 02:03:30,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:03:30,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:03:30,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2024-11-09 02:03:30,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f603782c1/44790f220af141858e021ed823aaacf5/FLAG2980dfda2 [2024-11-09 02:03:30,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f603782c1/44790f220af141858e021ed823aaacf5 [2024-11-09 02:03:30,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:03:30,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:03:30,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:03:30,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:03:30,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:03:30,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:03:30" (1/1) ... [2024-11-09 02:03:30,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49358644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:30, skipping insertion in model container [2024-11-09 02:03:30,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:03:30" (1/1) ... [2024-11-09 02:03:30,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:03:31,165 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_variablewrapping_wrapper-s_file-43.i[916,929] [2024-11-09 02:03:31,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:03:31,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:03:31,288 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_variablewrapping_wrapper-s_file-43.i[916,929] [2024-11-09 02:03:31,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:03:31,371 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:03:31,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31 WrapperNode [2024-11-09 02:03:31,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:03:31,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:03:31,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:03:31,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:03:31,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,448 INFO L138 Inliner]: procedures = 34, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-09 02:03:31,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:03:31,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:03:31,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:03:31,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:03:31,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,524 INFO L175 MemorySlicer]: Split 145 memory accesses to 2 slices as follows [2, 143]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 40 writes are split as follows [0, 40]. [2024-11-09 02:03:31,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:03:31,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:03:31,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:03:31,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:03:31,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (1/1) ... [2024-11-09 02:03:31,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:03:31,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:03:31,639 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-09 02:03:31,644 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-09 02:03:31,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:03:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:03:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:03:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:03:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:03:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:03:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:03:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:03:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:03:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:03:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:03:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:03:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:03:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:03:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:03:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:03:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:03:31,858 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:03:31,860 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:03:33,527 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-09 02:03:33,527 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:03:33,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:03:33,563 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:03:33,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:03:33 BoogieIcfgContainer [2024-11-09 02:03:33,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:03:33,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:03:33,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:03:33,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:03:33,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:03:30" (1/3) ... [2024-11-09 02:03:33,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583c32c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:03:33, skipping insertion in model container [2024-11-09 02:03:33,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:03:31" (2/3) ... [2024-11-09 02:03:33,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583c32c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:03:33, skipping insertion in model container [2024-11-09 02:03:33,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:03:33" (3/3) ... [2024-11-09 02:03:33,574 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-43.i [2024-11-09 02:03:33,590 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:03:33,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:03:33,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:03:33,664 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;@78dd694e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:03:33,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:03:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 02:03:33,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:33,686 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:33,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:33,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1561133314, now seen corresponding path program 1 times [2024-11-09 02:03:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:03:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420330897] [2024-11-09 02:03:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:33,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:03:33,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:03:33,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 02:03:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:34,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:03:34,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-09 02:03:34,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:03:34,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:03:34,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420330897] [2024-11-09 02:03:34,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420330897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:34,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:34,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:03:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322354935] [2024-11-09 02:03:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:34,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:03:34,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:03:34,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:03:34,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:03:34,264 INFO L87 Difference]: Start difference. First operand has 113 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:34,302 INFO L93 Difference]: Finished difference Result 219 states and 346 transitions. [2024-11-09 02:03:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:03:34,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-09 02:03:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:34,312 INFO L225 Difference]: With dead ends: 219 [2024-11-09 02:03:34,312 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 02:03:34,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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-09 02:03:34,320 INFO L432 NwaCegarLoop]: 159 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, 159 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-09 02:03:34,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:03:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 02:03:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 02:03:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-11-09 02:03:34,365 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 165 [2024-11-09 02:03:34,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:34,365 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-11-09 02:03:34,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-11-09 02:03:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 02:03:34,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:34,369 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:34,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 02:03:34,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:34,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:34,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1953213538, now seen corresponding path program 1 times [2024-11-09 02:03:34,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:03:34,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322720837] [2024-11-09 02:03:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:34,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:34,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:03:34,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:03:34,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 02:03:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:35,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:03:35,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:35,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:03:35,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:03:35,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322720837] [2024-11-09 02:03:35,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322720837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:35,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:35,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:03:35,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250956668] [2024-11-09 02:03:35,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:35,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:03:35,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:03:35,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:03:35,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:03:35,205 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:35,297 INFO L93 Difference]: Finished difference Result 220 states and 322 transitions. [2024-11-09 02:03:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:03:35,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-09 02:03:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:35,303 INFO L225 Difference]: With dead ends: 220 [2024-11-09 02:03:35,305 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 02:03:35,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:03:35,307 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:35,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 600 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:03:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 02:03:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-09 02:03:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-09 02:03:35,329 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 165 [2024-11-09 02:03:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:35,332 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-09 02:03:35,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-09 02:03:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 02:03:35,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:35,338 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:35,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 02:03:35,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:35,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:35,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1661695388, now seen corresponding path program 1 times [2024-11-09 02:03:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:03:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662354885] [2024-11-09 02:03:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:35,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:35,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:03:35,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:03:35,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 02:03:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:35,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 02:03:35,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:03:36,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:03:36,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:03:36,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662354885] [2024-11-09 02:03:36,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662354885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:36,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:36,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:03:36,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653477445] [2024-11-09 02:03:36,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:03:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:03:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:03:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:36,051 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:36,128 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2024-11-09 02:03:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:03:36,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-09 02:03:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:36,143 INFO L225 Difference]: With dead ends: 226 [2024-11-09 02:03:36,143 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:03:36,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:36,149 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:36,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 740 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:03:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:03:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-09 02:03:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-11-09 02:03:36,168 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 165 [2024-11-09 02:03:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-11-09 02:03:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 02:03:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-11-09 02:03:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 02:03:36,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:36,174 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:36,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 02:03:36,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:36,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:36,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 113311974, now seen corresponding path program 1 times [2024-11-09 02:03:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:03:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335024350] [2024-11-09 02:03:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:36,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:03:36,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:03:36,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 02:03:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:36,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:03:36,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:36,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 02:03:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-09 02:03:37,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:03:37,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:03:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335024350] [2024-11-09 02:03:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335024350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:37,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:37,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:03:37,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324367076] [2024-11-09 02:03:37,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:37,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:03:37,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:03:37,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:03:37,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:37,020 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:38,316 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-11-09 02:03:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:03:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-09 02:03:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:38,318 INFO L225 Difference]: With dead ends: 228 [2024-11-09 02:03:38,318 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:03:38,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:03:38,320 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 139 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:38,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 460 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 02:03:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:03:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-09 02:03:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-11-09 02:03:38,329 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 165 [2024-11-09 02:03:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:38,329 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-11-09 02:03:38,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-11-09 02:03:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 02:03:38,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:38,331 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:38,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 02:03:38,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:38,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:38,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash -709761824, now seen corresponding path program 1 times [2024-11-09 02:03:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:03:38,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108720894] [2024-11-09 02:03:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:38,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:38,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:03:38,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:03:38,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 02:03:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:38,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:03:38,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:39,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 02:03:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-09 02:03:39,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:03:39,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:03:39,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108720894] [2024-11-09 02:03:39,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108720894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:39,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:39,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:03:39,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291897913] [2024-11-09 02:03:39,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:39,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:03:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:03:39,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:03:39,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:03:39,054 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:40,229 INFO L93 Difference]: Finished difference Result 228 states and 326 transitions. [2024-11-09 02:03:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:03:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2024-11-09 02:03:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:40,232 INFO L225 Difference]: With dead ends: 228 [2024-11-09 02:03:40,232 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:03:40,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:03:40,234 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 129 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:40,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 456 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:03:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:03:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-09 02:03:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:03:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-09 02:03:40,243 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 167 [2024-11-09 02:03:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:40,244 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-09 02:03:40,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-09 02:03:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:40,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:40,246 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:40,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 02:03:40,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:40,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:40,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1995820070, now seen corresponding path program 1 times [2024-11-09 02:03:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:03:40,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189603840] [2024-11-09 02:03:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:40,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:40,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:03:40,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:03:40,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 02:03:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:41,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 02:03:41,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:41,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:41,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-09 02:03:41,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:41,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2024-11-09 02:03:41,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:41,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 35 [2024-11-09 02:03:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 02:03:41,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:03:41,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:03:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189603840] [2024-11-09 02:03:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189603840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:41,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:03:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715312254] [2024-11-09 02:03:41,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:41,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:03:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:03:41,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:03:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:03:41,452 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:46,704 INFO L93 Difference]: Finished difference Result 386 states and 543 transitions. [2024-11-09 02:03:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 02:03:46,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-09 02:03:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:46,708 INFO L225 Difference]: With dead ends: 386 [2024-11-09 02:03:46,708 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 02:03:46,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-09 02:03:46,712 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 346 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:46,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 515 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 02:03:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 02:03:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2024-11-09 02:03:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.3080568720379147) internal successors, (276), 213 states have internal predecessors, (276), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 02:03:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 372 transitions. [2024-11-09 02:03:46,756 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 372 transitions. Word has length 169 [2024-11-09 02:03:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:46,757 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 372 transitions. [2024-11-09 02:03:46,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 372 transitions. [2024-11-09 02:03:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:46,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:46,759 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:46,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 02:03:46,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:46,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:46,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1876445400, now seen corresponding path program 1 times [2024-11-09 02:03:46,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:03:46,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794457524] [2024-11-09 02:03:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:46,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:46,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:03:46,964 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:03:46,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 02:03:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:47,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 02:03:47,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:47,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:47,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-09 02:03:47,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:47,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2024-11-09 02:03:47,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:47,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 113 [2024-11-09 02:03:48,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:48,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 120 treesize of output 127 [2024-11-09 02:03:48,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:48,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 131 treesize of output 49 [2024-11-09 02:03:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 02:03:48,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:03:48,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:03:48,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794457524] [2024-11-09 02:03:48,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794457524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:03:48,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:03:48,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:03:48,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836609114] [2024-11-09 02:03:48,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:03:48,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:03:48,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:03:48,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:03:48,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:03:48,371 INFO L87 Difference]: Start difference. First operand 264 states and 372 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:03:55,942 INFO L93 Difference]: Finished difference Result 568 states and 790 transitions. [2024-11-09 02:03:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 02:03:55,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-09 02:03:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:03:55,946 INFO L225 Difference]: With dead ends: 568 [2024-11-09 02:03:55,946 INFO L226 Difference]: Without dead ends: 360 [2024-11-09 02:03:55,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-09 02:03:55,948 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 520 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:03:55,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 660 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-09 02:03:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-09 02:03:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 264. [2024-11-09 02:03:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 213 states have internal predecessors, (274), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 02:03:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 370 transitions. [2024-11-09 02:03:55,987 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 370 transitions. Word has length 169 [2024-11-09 02:03:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:03:55,989 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 370 transitions. [2024-11-09 02:03:55,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 02:03:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2024-11-09 02:03:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 02:03:55,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:03:55,994 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:03:56,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 02:03:56,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:56,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:03:56,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:03:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1397453542, now seen corresponding path program 1 times [2024-11-09 02:03:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:03:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384894294] [2024-11-09 02:03:56,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:56,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:03:56,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:03:56,198 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:03:56,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 02:03:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:56,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 02:03:56,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:56,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:03:56,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 91 [2024-11-09 02:03:57,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:57,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-09 02:03:57,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:57,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-09 02:03:57,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:57,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-09 02:03:58,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:58,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 118 [2024-11-09 02:03:58,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:58,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-09 02:03:59,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:59,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 109 [2024-11-09 02:03:59,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:03:59,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 115 [2024-11-09 02:04:00,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:00,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-09 02:04:00,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:00,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 119 [2024-11-09 02:04:01,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:01,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 128 [2024-11-09 02:04:01,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:01,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 120 treesize of output 122 [2024-11-09 02:04:02,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:02,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 109 [2024-11-09 02:04:02,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:02,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 113 treesize of output 107 [2024-11-09 02:04:02,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:02,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 123 [2024-11-09 02:04:03,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:03,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 127 treesize of output 138 [2024-11-09 02:04:03,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:03,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 142 treesize of output 152 [2024-11-09 02:04:03,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:04:03,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 179 treesize of output 85 [2024-11-09 02:04:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 32 proven. 672 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 02:04:03,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:04:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 02:04:04,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:04:04,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384894294] [2024-11-09 02:04:04,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384894294] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 02:04:04,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:04:04,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-11-09 02:04:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125071766] [2024-11-09 02:04:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:04,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:04:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:04:04,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:04:04,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-09 02:04:04,183 INFO L87 Difference]: Start difference. First operand 264 states and 370 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)