/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 01:27:02,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 01:27:02,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 01:27:02,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 01:27:02,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 01:27:02,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 01:27:02,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 01:27:02,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 01:27:02,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 01:27:02,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 01:27:02,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 01:27:02,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 01:27:02,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 01:27:02,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 01:27:02,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 01:27:02,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 01:27:02,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 01:27:02,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 01:27:02,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 01:27:02,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 01:27:02,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 01:27:02,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 01:27:02,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 01:27:02,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 01:27:02,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 01:27:02,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 01:27:02,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 01:27:02,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 01:27:02,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 01:27:02,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 01:27:02,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 01:27:02,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 01:27:02,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 01:27:02,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 01:27:02,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 01:27:02,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 01:27:02,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 01:27:02,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 01:27:02,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 01:27:02,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 01:27:02,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 01:27:02,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-24 01:27:02,287 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 01:27:02,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 01:27:02,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 01:27:02,288 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-24 01:27:02,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 01:27:02,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-24 01:27:02,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 01:27:02,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 01:27:02,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 01:27:02,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 01:27:02,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-24 01:27:02,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 01:27:02,290 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 01:27:02,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 01:27:02,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 01:27:02,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 01:27:02,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 01:27:02,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 01:27:02,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:27:02,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 01:27:02,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 01:27:02,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 01:27:02,291 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-24 01:27:02,291 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-24 01:27:02,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 01:27:02,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 01:27:02,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 01:27:02,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 01:27:02,480 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 01:27:02,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-02-24 01:27:02,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9225f4202/84423a55a61248d8b74fd90def3fc429/FLAG0b1dc1fe9 [2022-02-24 01:27:02,831 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 01:27:02,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-02-24 01:27:02,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9225f4202/84423a55a61248d8b74fd90def3fc429/FLAG0b1dc1fe9 [2022-02-24 01:27:03,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9225f4202/84423a55a61248d8b74fd90def3fc429 [2022-02-24 01:27:03,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 01:27:03,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 01:27:03,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 01:27:03,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 01:27:03,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 01:27:03,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b66e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03, skipping insertion in model container [2022-02-24 01:27:03,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 01:27:03,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 01:27:03,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2022-02-24 01:27:03,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:27:03,474 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 01:27:03,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2022-02-24 01:27:03,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 01:27:03,514 INFO L208 MainTranslator]: Completed translation [2022-02-24 01:27:03,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03 WrapperNode [2022-02-24 01:27:03,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 01:27:03,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 01:27:03,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 01:27:03,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 01:27:03,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 01:27:03,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 01:27:03,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 01:27:03,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 01:27:03,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (1/1) ... [2022-02-24 01:27:03,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 01:27:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 01:27:03,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-24 01:27:03,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-24 01:27:03,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 01:27:03,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 01:27:03,621 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 01:27:03,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-24 01:27:03,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-24 01:27:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 01:27:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 01:27:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 01:27:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-02-24 01:27:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-02-24 01:27:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 01:27:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 01:27:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-24 01:27:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-24 01:27:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 01:27:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 01:27:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 01:27:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 01:27:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 01:27:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 01:27:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 01:27:03,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 01:27:03,714 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 01:27:03,715 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 01:27:03,828 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 01:27:03,833 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 01:27:03,833 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-24 01:27:03,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:27:03 BoogieIcfgContainer [2022-02-24 01:27:03,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 01:27:03,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 01:27:03,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 01:27:03,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 01:27:03,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 01:27:03" (1/3) ... [2022-02-24 01:27:03,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1649433f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:27:03, skipping insertion in model container [2022-02-24 01:27:03,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 01:27:03" (2/3) ... [2022-02-24 01:27:03,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1649433f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 01:27:03, skipping insertion in model container [2022-02-24 01:27:03,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 01:27:03" (3/3) ... [2022-02-24 01:27:03,843 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2022-02-24 01:27:03,846 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 01:27:03,846 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 01:27:03,875 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 01:27:03,880 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=JORDAN [2022-02-24 01:27:03,880 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 01:27:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-24 01:27:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-24 01:27:03,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:27:03,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:03,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:27:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:27:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2022-02-24 01:27:03,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:27:03,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [87933513] [2022-02-24 01:27:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:27:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:27:03,950 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:27:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:27:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:27:04,150 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:27:04,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [87933513] [2022-02-24 01:27:04,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [87933513] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:27:04,152 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:27:04,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:27:04,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215515469] [2022-02-24 01:27:04,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:27:04,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:27:04,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:27:04,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:27:04,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:27:04,182 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:27:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:27:04,515 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2022-02-24 01:27:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 01:27:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-24 01:27:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:27:04,527 INFO L225 Difference]: With dead ends: 88 [2022-02-24 01:27:04,527 INFO L226 Difference]: Without dead ends: 47 [2022-02-24 01:27:04,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:27:04,533 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 01:27:04,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 01:27:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-24 01:27:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-02-24 01:27:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-24 01:27:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-02-24 01:27:04,574 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2022-02-24 01:27:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:27:04,575 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-02-24 01:27:04,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:27:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-02-24 01:27:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-24 01:27:04,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:27:04,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:04,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 01:27:04,577 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:27:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:27:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2022-02-24 01:27:04,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:27:04,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [129014345] [2022-02-24 01:27:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:27:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:27:04,580 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:27:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:27:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:27:04,641 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:27:04,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [129014345] [2022-02-24 01:27:04,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [129014345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:27:04,641 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:27:04,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:27:04,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032052029] [2022-02-24 01:27:04,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:27:04,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:27:04,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:27:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:27:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:27:04,643 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:27:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:27:04,783 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-02-24 01:27:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 01:27:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-24 01:27:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:27:04,785 INFO L225 Difference]: With dead ends: 55 [2022-02-24 01:27:04,785 INFO L226 Difference]: Without dead ends: 53 [2022-02-24 01:27:04,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:27:04,786 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:27:04,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:27:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-24 01:27:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-02-24 01:27:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-24 01:27:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2022-02-24 01:27:04,797 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2022-02-24 01:27:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:27:04,797 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2022-02-24 01:27:04,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 01:27:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-02-24 01:27:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-24 01:27:04,798 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:27:04,798 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:04,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 01:27:04,798 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:27:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:27:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2022-02-24 01:27:04,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:27:04,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1360647239] [2022-02-24 01:27:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:27:04,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:27:04,806 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:27:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:04,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:27:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-24 01:27:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:27:04,864 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:27:04,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1360647239] [2022-02-24 01:27:04,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1360647239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:27:04,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:27:04,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:27:04,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943104303] [2022-02-24 01:27:04,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:27:04,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:27:04,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:27:04,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:27:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:27:04,865 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:27:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:27:05,024 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-24 01:27:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 01:27:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-24 01:27:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:27:05,026 INFO L225 Difference]: With dead ends: 57 [2022-02-24 01:27:05,026 INFO L226 Difference]: Without dead ends: 55 [2022-02-24 01:27:05,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:27:05,027 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:27:05,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:27:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-24 01:27:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-24 01:27:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-24 01:27:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-02-24 01:27:05,035 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2022-02-24 01:27:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:27:05,036 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-02-24 01:27:05,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-24 01:27:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-02-24 01:27:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-24 01:27:05,036 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:27:05,036 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:05,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 01:27:05,037 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:27:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:27:05,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2022-02-24 01:27:05,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:27:05,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1486893154] [2022-02-24 01:27:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:27:05,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:27:05,039 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:27:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:27:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-24 01:27:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 01:27:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:27:05,114 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:27:05,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1486893154] [2022-02-24 01:27:05,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1486893154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:27:05,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:27:05,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 01:27:05,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101116076] [2022-02-24 01:27:05,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:27:05,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 01:27:05,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:27:05,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 01:27:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-24 01:27:05,116 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 01:27:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:27:05,276 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-02-24 01:27:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 01:27:05,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-24 01:27:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:27:05,277 INFO L225 Difference]: With dead ends: 61 [2022-02-24 01:27:05,277 INFO L226 Difference]: Without dead ends: 59 [2022-02-24 01:27:05,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-24 01:27:05,278 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:27:05,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 59 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:27:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-24 01:27:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-24 01:27:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-24 01:27:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-02-24 01:27:05,287 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2022-02-24 01:27:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:27:05,287 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-02-24 01:27:05,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-24 01:27:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-02-24 01:27:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-24 01:27:05,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:27:05,288 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:05,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 01:27:05,288 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:27:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:27:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2022-02-24 01:27:05,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:27:05,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [781311193] [2022-02-24 01:27:05,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:27:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:27:05,290 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:27:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:27:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-24 01:27:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 01:27:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 01:27:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 01:27:05,346 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:27:05,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [781311193] [2022-02-24 01:27:05,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [781311193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:27:05,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:27:05,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 01:27:05,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835809934] [2022-02-24 01:27:05,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:27:05,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 01:27:05,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:27:05,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 01:27:05,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 01:27:05,348 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-24 01:27:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:27:05,544 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-02-24 01:27:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 01:27:05,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-24 01:27:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:27:05,545 INFO L225 Difference]: With dead ends: 66 [2022-02-24 01:27:05,546 INFO L226 Difference]: Without dead ends: 64 [2022-02-24 01:27:05,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 01:27:05,547 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 01:27:05,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 01:27:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-24 01:27:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-02-24 01:27:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-24 01:27:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-02-24 01:27:05,555 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2022-02-24 01:27:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:27:05,556 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-02-24 01:27:05,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-24 01:27:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-02-24 01:27:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-24 01:27:05,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:27:05,557 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:05,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 01:27:05,557 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:27:05,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:27:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2022-02-24 01:27:05,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:27:05,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2093054716] [2022-02-24 01:27:05,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:27:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:27:05,559 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:27:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:27:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-24 01:27:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 01:27:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-24 01:27:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 01:27:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-24 01:27:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-24 01:27:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-24 01:27:05,636 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:27:05,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2093054716] [2022-02-24 01:27:05,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2093054716] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:27:05,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:27:05,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 01:27:05,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582151167] [2022-02-24 01:27:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:27:05,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 01:27:05,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:27:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 01:27:05,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-24 01:27:05,637 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-24 01:27:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:27:05,786 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-02-24 01:27:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 01:27:05,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-02-24 01:27:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:27:05,788 INFO L225 Difference]: With dead ends: 75 [2022-02-24 01:27:05,788 INFO L226 Difference]: Without dead ends: 73 [2022-02-24 01:27:05,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-24 01:27:05,791 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:27:05,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 52 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:27:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-24 01:27:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-02-24 01:27:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-24 01:27:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-02-24 01:27:05,812 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2022-02-24 01:27:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:27:05,814 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-02-24 01:27:05,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-24 01:27:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-02-24 01:27:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-24 01:27:05,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:27:05,820 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:05,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 01:27:05,820 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:27:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:27:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2022-02-24 01:27:05,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:27:05,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936204822] [2022-02-24 01:27:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:27:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:27:05,823 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:27:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:27:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-24 01:27:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 01:27:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-24 01:27:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 01:27:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-24 01:27:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-24 01:27:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-24 01:27:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-24 01:27:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-24 01:27:05,923 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:27:05,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936204822] [2022-02-24 01:27:05,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1936204822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:27:05,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:27:05,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 01:27:05,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774152862] [2022-02-24 01:27:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:27:05,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 01:27:05,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:27:05,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 01:27:05,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-24 01:27:05,924 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-24 01:27:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:27:06,081 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-02-24 01:27:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 01:27:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-02-24 01:27:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:27:06,083 INFO L225 Difference]: With dead ends: 75 [2022-02-24 01:27:06,083 INFO L226 Difference]: Without dead ends: 73 [2022-02-24 01:27:06,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-02-24 01:27:06,084 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:27:06,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:27:06,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-24 01:27:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-02-24 01:27:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-24 01:27:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-02-24 01:27:06,094 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2022-02-24 01:27:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:27:06,094 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-02-24 01:27:06,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-24 01:27:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-02-24 01:27:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-24 01:27:06,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 01:27:06,095 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:06,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 01:27:06,096 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 01:27:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 01:27:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2022-02-24 01:27:06,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 01:27:06,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1297433739] [2022-02-24 01:27:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 01:27:06,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 01:27:06,098 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 01:27:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 01:27:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-24 01:27:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 01:27:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-24 01:27:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 01:27:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-24 01:27:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-24 01:27:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-24 01:27:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-24 01:27:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-24 01:27:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-24 01:27:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 01:27:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-24 01:27:06,209 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 01:27:06,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1297433739] [2022-02-24 01:27:06,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1297433739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 01:27:06,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 01:27:06,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 01:27:06,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456114428] [2022-02-24 01:27:06,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 01:27:06,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 01:27:06,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 01:27:06,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 01:27:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-24 01:27:06,210 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-24 01:27:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 01:27:06,414 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-02-24 01:27:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 01:27:06,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2022-02-24 01:27:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 01:27:06,415 INFO L225 Difference]: With dead ends: 73 [2022-02-24 01:27:06,415 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 01:27:06,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-02-24 01:27:06,417 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 01:27:06,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 61 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 01:27:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 01:27:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 01:27:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-24 01:27:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 01:27:06,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-02-24 01:27:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 01:27:06,418 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 01:27:06,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-24 01:27:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 01:27:06,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 01:27:06,420 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 01:27:06,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 01:27:06,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 01:27:06,753 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-02-24 01:27:06,753 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-02-24 01:27:06,753 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-02-24 01:27:06,753 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-02-24 01:27:06,753 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-02-24 01:27:06,754 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-02-24 01:27:06,754 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-02-24 01:27:06,754 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,754 INFO L861 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-02-24 01:27:06,754 INFO L854 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,754 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 67) the Hoare annotation is: true [2022-02-24 01:27:06,754 INFO L854 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,754 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,754 INFO L854 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L36(lines 36 63) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,755 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,756 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 24 67) the Hoare annotation is: true [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,756 INFO L861 garLoopResultBuilder]: At program point L34-3(lines 34 65) the Hoare annotation is: true [2022-02-24 01:27:06,756 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,756 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-02-24 01:27:06,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-24 01:27:06,757 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-24 01:27:06,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-24 01:27:06,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-24 01:27:06,757 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-24 01:27:06,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 01:27:06,757 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-24 01:27:06,757 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-24 01:27:06,757 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-02-24 01:27:06,757 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-24 01:27:06,757 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-24 01:27:06,757 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-24 01:27:06,758 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-24 01:27:06,760 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 01:27:06,761 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 01:27:06,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 01:27:06 BoogieIcfgContainer [2022-02-24 01:27:06,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 01:27:06,772 INFO L158 Benchmark]: Toolchain (without parser) took 3501.12ms. Allocated memory was 203.4MB in the beginning and 266.3MB in the end (delta: 62.9MB). Free memory was 152.7MB in the beginning and 197.8MB in the end (delta: -45.1MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2022-02-24 01:27:06,772 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 01:27:06,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.07ms. Allocated memory was 203.4MB in the beginning and 266.3MB in the end (delta: 62.9MB). Free memory was 152.6MB in the beginning and 243.2MB in the end (delta: -90.6MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2022-02-24 01:27:06,772 INFO L158 Benchmark]: Boogie Preprocessor took 35.24ms. Allocated memory is still 266.3MB. Free memory was 243.2MB in the beginning and 241.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-24 01:27:06,772 INFO L158 Benchmark]: RCFGBuilder took 283.75ms. Allocated memory is still 266.3MB. Free memory was 241.5MB in the beginning and 229.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-24 01:27:06,772 INFO L158 Benchmark]: TraceAbstraction took 2935.05ms. Allocated memory is still 266.3MB. Free memory was 229.1MB in the beginning and 197.8MB in the end (delta: 31.2MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. [2022-02-24 01:27:06,773 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.07ms. Allocated memory was 203.4MB in the beginning and 266.3MB in the end (delta: 62.9MB). Free memory was 152.6MB in the beginning and 243.2MB in the end (delta: -90.6MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.24ms. Allocated memory is still 266.3MB. Free memory was 243.2MB in the beginning and 241.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 283.75ms. Allocated memory is still 266.3MB. Free memory was 241.5MB in the beginning and 229.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2935.05ms. Allocated memory is still 266.3MB. Free memory was 229.1MB in the beginning and 197.8MB in the end (delta: 31.2MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 459 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1482 IncrementalHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 294 mSDtfsCounter, 1482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 235 PreInvPairs, 302 NumberOfFragments, 561 HoareAnnotationTreeSize, 235 FomulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 43 FomulaSimplificationsInter, 581 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= j) && 5 + j <= bufsize) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-02-24 01:27:06,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...