/usr/bin/java -ea -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-e106359-m [2022-04-15 06:09:07,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:09:07,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:09:07,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:09:07,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:09:07,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:09:07,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:09:07,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:09:07,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:09:07,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:09:07,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:09:07,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:09:07,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:09:07,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:09:07,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:09:07,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:09:07,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:09:07,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:09:07,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:09:07,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:09:07,297 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:09:07,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:09:07,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:09:07,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:09:07,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:09:07,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:09:07,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:09:07,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:09:07,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:09:07,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:09:07,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:09:07,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:09:07,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:09:07,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:09:07,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:09:07,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:09:07,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:09:07,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:09:07,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:09:07,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:09:07,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:09:07,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:09:07,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:09:07,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:09:07,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:09:07,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:09:07,323 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:09:07,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:09:07,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:09:07,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:09:07,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:09:07,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:09:07,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:09:07,325 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:09:07,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:09:07,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:09:07,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:09:07,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:09:07,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:09:07,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:09:07,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:09:07,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:09:07,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:09:07,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:09:07,326 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:09:07,326 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:09:07,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:09:07,327 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:09:07,327 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-04-15 06:09:07,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:09:07,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:09:07,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:09:07,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:09:07,591 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:09:07,592 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-04-15 06:09:07,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887868f47/8c8fafdc175f469fabdfed7fc69b1e86/FLAG2dd2f4a27 [2022-04-15 06:09:08,336 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:09:08,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-04-15 06:09:08,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887868f47/8c8fafdc175f469fabdfed7fc69b1e86/FLAG2dd2f4a27 [2022-04-15 06:09:08,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887868f47/8c8fafdc175f469fabdfed7fc69b1e86 [2022-04-15 06:09:08,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:09:08,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:09:08,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:09:08,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:09:08,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:09:08,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:09:08" (1/1) ... [2022-04-15 06:09:08,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dec7d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:08, skipping insertion in model container [2022-04-15 06:09:08,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:09:08" (1/1) ... [2022-04-15 06:09:08,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:09:08,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:09:09,027 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-04-15 06:09:09,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:09:09,084 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:09:09,116 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-04-15 06:09:09,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:09:09,159 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:09:09,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09 WrapperNode [2022-04-15 06:09:09,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:09:09,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:09:09,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:09:09,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:09:09,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (1/1) ... [2022-04-15 06:09:09,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (1/1) ... [2022-04-15 06:09:09,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (1/1) ... [2022-04-15 06:09:09,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (1/1) ... [2022-04-15 06:09:09,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (1/1) ... [2022-04-15 06:09:09,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (1/1) ... [2022-04-15 06:09:09,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (1/1) ... [2022-04-15 06:09:09,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:09:09,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:09:09,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:09:09,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:09:09,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (1/1) ... [2022-04-15 06:09:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:09:09,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:09:09,309 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-04-15 06:09:09,332 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-04-15 06:09:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:09:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:09:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:09:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:09:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:09:09,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:09:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:09:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:09:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:09:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:09:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:09:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:09:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:09:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:09:09,503 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:09:09,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:09:09,864 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:09:09,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:09:09,872 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:09:09,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:09:09 BoogieIcfgContainer [2022-04-15 06:09:09,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:09:09,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:09:09,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:09:09,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:09:09,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:09:08" (1/3) ... [2022-04-15 06:09:09,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2596469c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:09:09, skipping insertion in model container [2022-04-15 06:09:09,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:09:09" (2/3) ... [2022-04-15 06:09:09,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2596469c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:09:09, skipping insertion in model container [2022-04-15 06:09:09,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:09:09" (3/3) ... [2022-04-15 06:09:09,881 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2022-04-15 06:09:09,886 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:09:09,886 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:09:09,933 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:09:09,941 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, 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 [2022-04-15 06:09:09,942 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:09:09,974 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-04-15 06:09:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:09:09,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:09,981 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:09:09,982 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:09,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2022-04-15 06:09:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:09,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320836396] [2022-04-15 06:09:10,008 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:09:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 2 times [2022-04-15 06:09:10,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:10,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390064333] [2022-04-15 06:09:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:10,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {46#true} is VALID [2022-04-15 06:09:10,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2022-04-15 06:09:10,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #126#return; {46#true} is VALID [2022-04-15 06:09:10,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:10,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {46#true} is VALID [2022-04-15 06:09:10,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2022-04-15 06:09:10,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #126#return; {46#true} is VALID [2022-04-15 06:09:10,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret11 := main(); {46#true} is VALID [2022-04-15 06:09:10,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {46#true} is VALID [2022-04-15 06:09:10,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {46#true} is VALID [2022-04-15 06:09:10,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {46#true} is VALID [2022-04-15 06:09:10,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {46#true} is VALID [2022-04-15 06:09:10,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#true} assume 1 + ~i~0 < ~len~0; {51#(not (<= main_~len~0 (+ main_~i~0 1)))} is VALID [2022-04-15 06:09:10,394 INFO L272 TraceCheckUtils]: 10: Hoare triple {51#(not (<= main_~len~0 (+ main_~i~0 1)))} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {52#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:10,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {53#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:10,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {47#false} is VALID [2022-04-15 06:09:10,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-04-15 06:09:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:10,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390064333] [2022-04-15 06:09:10,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390064333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:10,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:10,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:09:10,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:10,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320836396] [2022-04-15 06:09:10,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320836396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:10,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:10,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:09:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932427765] [2022-04-15 06:09:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:10,409 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-04-15 06:09:10,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:10,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 06:09:10,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:10,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:09:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:09:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:09:10,473 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-04-15 06:09:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:11,354 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2022-04-15 06:09:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:09:11,355 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-04-15 06:09:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2022-04-15 06:09:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2022-04-15 06:09:11,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2022-04-15 06:09:11,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:11,581 INFO L225 Difference]: With dead ends: 88 [2022-04-15 06:09:11,582 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:09:11,585 INFO L912 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-04-15 06:09:11,588 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:11,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:09:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:09:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-04-15 06:09:11,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:11,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second 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-04-15 06:09:11,631 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second 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-04-15 06:09:11,632 INFO L87 Difference]: Start difference. First operand 47 states. Second 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-04-15 06:09:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:11,638 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-04-15 06:09:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-04-15 06:09:11,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:11,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:11,641 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 47 states. [2022-04-15 06:09:11,641 INFO L87 Difference]: Start difference. First 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) Second operand 47 states. [2022-04-15 06:09:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:11,646 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-04-15 06:09:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-04-15 06:09:11,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:11,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:11,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:11,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:11,649 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-04-15 06:09:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-15 06:09:11,654 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2022-04-15 06:09:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:11,655 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-15 06:09:11,655 INFO L479 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-04-15 06:09:11,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-15 06:09:11,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 06:09:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:09:11,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:11,733 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:09:11,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:09:11,733 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2022-04-15 06:09:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:11,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [278677019] [2022-04-15 06:09:11,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:09:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 2 times [2022-04-15 06:09:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:11,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202160911] [2022-04-15 06:09:11,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:11,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:11,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {421#true} is VALID [2022-04-15 06:09:11,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} assume true; {421#true} is VALID [2022-04-15 06:09:11,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#true} {421#true} #126#return; {421#true} is VALID [2022-04-15 06:09:11,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {421#true} call ULTIMATE.init(); {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:11,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {421#true} is VALID [2022-04-15 06:09:11,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#true} assume true; {421#true} is VALID [2022-04-15 06:09:11,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#true} {421#true} #126#return; {421#true} is VALID [2022-04-15 06:09:11,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#true} call #t~ret11 := main(); {421#true} is VALID [2022-04-15 06:09:11,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {421#true} is VALID [2022-04-15 06:09:11,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {421#true} is VALID [2022-04-15 06:09:11,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {426#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-15 06:09:11,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {426#(not (<= main_~len~0 main_~i~0))} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {426#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-15 06:09:11,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {426#(not (<= main_~len~0 main_~i~0))} assume !(1 + ~i~0 < ~len~0); {426#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-15 06:09:11,898 INFO L272 TraceCheckUtils]: 10: Hoare triple {426#(not (<= main_~len~0 main_~i~0))} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {427#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:11,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {427#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {428#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:11,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {422#false} is VALID [2022-04-15 06:09:11,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} assume !false; {422#false} is VALID [2022-04-15 06:09:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:11,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202160911] [2022-04-15 06:09:11,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202160911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:11,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:11,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:09:11,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:11,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [278677019] [2022-04-15 06:09:11,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [278677019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:11,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:11,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:09:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130521071] [2022-04-15 06:09:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:11,902 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-04-15 06:09:11,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:11,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 06:09:11,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:11,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:09:11,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:11,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:09:11,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:09:11,932 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-04-15 06:09:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:12,596 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-15 06:09:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:09:12,596 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-04-15 06:09:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 06:09:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 06:09:12,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-15 06:09:12,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:12,675 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:09:12,675 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:09:12,676 INFO L912 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-04-15 06:09:12,677 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:12,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:09:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:09:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-15 06:09:12,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:12,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second 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-04-15 06:09:12,707 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second 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-04-15 06:09:12,708 INFO L87 Difference]: Start difference. First operand 53 states. Second 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-04-15 06:09:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:12,712 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 06:09:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-15 06:09:12,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:12,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:12,714 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 53 states. [2022-04-15 06:09:12,714 INFO L87 Difference]: Start difference. First 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) Second operand 53 states. [2022-04-15 06:09:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:12,718 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 06:09:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-15 06:09:12,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:12,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:12,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:12,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:12,720 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-04-15 06:09:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2022-04-15 06:09:12,723 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2022-04-15 06:09:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:12,724 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2022-04-15 06:09:12,724 INFO L479 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-04-15 06:09:12,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 67 transitions. [2022-04-15 06:09:12,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-15 06:09:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:09:12,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:12,803 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:09:12,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:09:12,804 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:12,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2022-04-15 06:09:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:12,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025211712] [2022-04-15 06:09:12,805 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:09:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 2 times [2022-04-15 06:09:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:12,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146168159] [2022-04-15 06:09:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:12,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:12,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:12,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {758#true} is VALID [2022-04-15 06:09:12,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {758#true} assume true; {758#true} is VALID [2022-04-15 06:09:12,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {758#true} {758#true} #126#return; {758#true} is VALID [2022-04-15 06:09:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 06:09:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:12,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {758#true} ~cond := #in~cond; {758#true} is VALID [2022-04-15 06:09:12,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {758#true} assume !(0 == ~cond); {758#true} is VALID [2022-04-15 06:09:12,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {758#true} assume true; {758#true} is VALID [2022-04-15 06:09:12,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {758#true} {763#(<= 0 main_~i~0)} #94#return; {763#(<= 0 main_~i~0)} is VALID [2022-04-15 06:09:12,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {758#true} call ULTIMATE.init(); {770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:12,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {758#true} is VALID [2022-04-15 06:09:12,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {758#true} assume true; {758#true} is VALID [2022-04-15 06:09:12,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {758#true} {758#true} #126#return; {758#true} is VALID [2022-04-15 06:09:12,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {758#true} call #t~ret11 := main(); {758#true} is VALID [2022-04-15 06:09:12,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {758#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {758#true} is VALID [2022-04-15 06:09:12,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {758#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {763#(<= 0 main_~i~0)} is VALID [2022-04-15 06:09:12,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {763#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {763#(<= 0 main_~i~0)} is VALID [2022-04-15 06:09:12,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {763#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {763#(<= 0 main_~i~0)} is VALID [2022-04-15 06:09:12,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {763#(<= 0 main_~i~0)} assume 1 + ~i~0 < ~len~0; {763#(<= 0 main_~i~0)} is VALID [2022-04-15 06:09:12,901 INFO L272 TraceCheckUtils]: 10: Hoare triple {763#(<= 0 main_~i~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {758#true} is VALID [2022-04-15 06:09:12,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {758#true} ~cond := #in~cond; {758#true} is VALID [2022-04-15 06:09:12,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {758#true} assume !(0 == ~cond); {758#true} is VALID [2022-04-15 06:09:12,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#true} assume true; {758#true} is VALID [2022-04-15 06:09:12,902 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {758#true} {763#(<= 0 main_~i~0)} #94#return; {763#(<= 0 main_~i~0)} is VALID [2022-04-15 06:09:12,903 INFO L272 TraceCheckUtils]: 15: Hoare triple {763#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {768#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:12,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {768#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {769#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:12,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {769#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {759#false} is VALID [2022-04-15 06:09:12,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {759#false} assume !false; {759#false} is VALID [2022-04-15 06:09:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:12,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146168159] [2022-04-15 06:09:12,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146168159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:12,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:12,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:09:12,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:12,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025211712] [2022-04-15 06:09:12,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025211712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:12,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:12,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:09:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273327700] [2022-04-15 06:09:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:12,907 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-04-15 06:09:12,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:12,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 06:09:12,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:12,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:09:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:12,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:09:12,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:09:12,924 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-04-15 06:09:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:13,439 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-15 06:09:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:09:13,441 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-04-15 06:09:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 06:09:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 06:09:13,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-15 06:09:13,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:13,511 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:09:13,511 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 06:09:13,512 INFO L912 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-04-15 06:09:13,515 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:13,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:09:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 06:09:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 06:09:13,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:13,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second 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-04-15 06:09:13,572 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second 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-04-15 06:09:13,572 INFO L87 Difference]: Start difference. First operand 55 states. Second 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-04-15 06:09:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:13,575 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 06:09:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 06:09:13,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:13,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:13,577 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 55 states. [2022-04-15 06:09:13,577 INFO L87 Difference]: Start difference. First 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) Second operand 55 states. [2022-04-15 06:09:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:13,580 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 06:09:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 06:09:13,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:13,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:13,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:13,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:13,582 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-04-15 06:09:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-04-15 06:09:13,585 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2022-04-15 06:09:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:13,585 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-04-15 06:09:13,585 INFO L479 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-04-15 06:09:13,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 70 transitions. [2022-04-15 06:09:13,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 06:09:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:09:13,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:13,681 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:09:13,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:09:13,684 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2022-04-15 06:09:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:13,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815210817] [2022-04-15 06:09:13,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:09:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 2 times [2022-04-15 06:09:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:13,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591610035] [2022-04-15 06:09:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:13,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {1132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1115#true} is VALID [2022-04-15 06:09:13,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-15 06:09:13,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1115#true} {1115#true} #126#return; {1115#true} is VALID [2022-04-15 06:09:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 06:09:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:13,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {1115#true} ~cond := #in~cond; {1115#true} is VALID [2022-04-15 06:09:13,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1115#true} assume !(0 == ~cond); {1115#true} is VALID [2022-04-15 06:09:13,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-15 06:09:13,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} #118#return; {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 06:09:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:13,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {1115#true} ~cond := #in~cond; {1115#true} is VALID [2022-04-15 06:09:13,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {1115#true} assume !(0 == ~cond); {1115#true} is VALID [2022-04-15 06:09:13,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-15 06:09:13,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} #120#return; {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:13,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:13,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {1132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1115#true} is VALID [2022-04-15 06:09:13,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-15 06:09:13,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #126#return; {1115#true} is VALID [2022-04-15 06:09:13,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret11 := main(); {1115#true} is VALID [2022-04-15 06:09:13,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {1115#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {1115#true} is VALID [2022-04-15 06:09:13,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {1115#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1120#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:13,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {1120#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {1120#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:13,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {1120#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:13,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume !(1 + ~i~0 < ~len~0); {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:13,834 INFO L272 TraceCheckUtils]: 10: Hoare triple {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1115#true} is VALID [2022-04-15 06:09:13,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#true} ~cond := #in~cond; {1115#true} is VALID [2022-04-15 06:09:13,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#true} assume !(0 == ~cond); {1115#true} is VALID [2022-04-15 06:09:13,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-15 06:09:13,835 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1115#true} {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} #118#return; {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:13,835 INFO L272 TraceCheckUtils]: 15: Hoare triple {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1115#true} is VALID [2022-04-15 06:09:13,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {1115#true} ~cond := #in~cond; {1115#true} is VALID [2022-04-15 06:09:13,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {1115#true} assume !(0 == ~cond); {1115#true} is VALID [2022-04-15 06:09:13,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {1115#true} assume true; {1115#true} is VALID [2022-04-15 06:09:13,836 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1115#true} {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} #120#return; {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:13,837 INFO L272 TraceCheckUtils]: 20: Hoare triple {1121#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1130#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:13,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {1130#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1131#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:13,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {1131#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1116#false} is VALID [2022-04-15 06:09:13,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2022-04-15 06:09:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:09:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591610035] [2022-04-15 06:09:13,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591610035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:13,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:13,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:09:13,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [815210817] [2022-04-15 06:09:13,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [815210817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:13,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:13,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:09:13,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393010455] [2022-04-15 06:09:13,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:13,840 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-04-15 06:09:13,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:13,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 06:09:13,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:13,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:09:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:09:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:09:13,857 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-04-15 06:09:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:14,601 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-15 06:09:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:09:14,601 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-04-15 06:09:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-15 06:09:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-15 06:09:14,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-15 06:09:14,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:14,683 INFO L225 Difference]: With dead ends: 61 [2022-04-15 06:09:14,683 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 06:09:14,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:09:14,684 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:14,685 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 59 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:09:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 06:09:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 06:09:14,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:14,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second 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-04-15 06:09:14,741 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second 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-04-15 06:09:14,741 INFO L87 Difference]: Start difference. First operand 59 states. Second 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-04-15 06:09:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:14,745 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 06:09:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 06:09:14,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:14,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:14,746 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 59 states. [2022-04-15 06:09:14,746 INFO L87 Difference]: Start difference. First 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) Second operand 59 states. [2022-04-15 06:09:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:14,749 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 06:09:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 06:09:14,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:14,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:14,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:14,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:14,750 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-04-15 06:09:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-15 06:09:14,753 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2022-04-15 06:09:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:14,753 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-04-15 06:09:14,753 INFO L479 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-04-15 06:09:14,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 73 transitions. [2022-04-15 06:09:14,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 06:09:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:09:14,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:14,830 INFO L499 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-04-15 06:09:14,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:09:14,830 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2022-04-15 06:09:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:14,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [969498646] [2022-04-15 06:09:14,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:09:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 2 times [2022-04-15 06:09:14,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:14,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735680374] [2022-04-15 06:09:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:14,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {1523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1503#true} is VALID [2022-04-15 06:09:14,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 06:09:14,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1503#true} {1503#true} #126#return; {1503#true} is VALID [2022-04-15 06:09:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 06:09:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:14,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-04-15 06:09:14,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-04-15 06:09:14,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 06:09:14,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1508#(<= 0 main_~j~0)} #118#return; {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 06:09:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:14,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-04-15 06:09:14,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-04-15 06:09:14,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 06:09:14,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1508#(<= 0 main_~j~0)} #120#return; {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 06:09:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:14,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-04-15 06:09:14,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-04-15 06:09:14,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 06:09:14,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1508#(<= 0 main_~j~0)} #122#return; {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:14,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1503#true} is VALID [2022-04-15 06:09:14,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 06:09:14,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #126#return; {1503#true} is VALID [2022-04-15 06:09:14,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret11 := main(); {1503#true} is VALID [2022-04-15 06:09:14,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {1503#true} is VALID [2022-04-15 06:09:14,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {1503#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1503#true} is VALID [2022-04-15 06:09:14,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {1503#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {1508#(<= 0 main_~j~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {1508#(<= 0 main_~j~0)} assume !(1 + ~i~0 < ~len~0); {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,958 INFO L272 TraceCheckUtils]: 10: Hoare triple {1508#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1503#true} is VALID [2022-04-15 06:09:14,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-04-15 06:09:14,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-04-15 06:09:14,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 06:09:14,959 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1503#true} {1508#(<= 0 main_~j~0)} #118#return; {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,960 INFO L272 TraceCheckUtils]: 15: Hoare triple {1508#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1503#true} is VALID [2022-04-15 06:09:14,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-04-15 06:09:14,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-04-15 06:09:14,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 06:09:14,961 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1503#true} {1508#(<= 0 main_~j~0)} #120#return; {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,961 INFO L272 TraceCheckUtils]: 20: Hoare triple {1508#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1503#true} is VALID [2022-04-15 06:09:14,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-04-15 06:09:14,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-04-15 06:09:14,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 06:09:14,962 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1503#true} {1508#(<= 0 main_~j~0)} #122#return; {1508#(<= 0 main_~j~0)} is VALID [2022-04-15 06:09:14,963 INFO L272 TraceCheckUtils]: 25: Hoare triple {1508#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1521#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:14,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {1521#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1522#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:14,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1504#false} is VALID [2022-04-15 06:09:14,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-04-15 06:09:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 06:09:14,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:14,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735680374] [2022-04-15 06:09:14,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735680374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:14,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:14,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:09:14,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:14,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [969498646] [2022-04-15 06:09:14,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [969498646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:14,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:14,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:09:14,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711098987] [2022-04-15 06:09:14,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:14,966 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-04-15 06:09:14,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:14,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 06:09:14,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:14,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:09:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:09:14,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:09:14,983 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-04-15 06:09:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:15,543 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 06:09:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:09:15,543 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-04-15 06:09:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-15 06:09:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-15 06:09:15,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-15 06:09:15,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:15,619 INFO L225 Difference]: With dead ends: 66 [2022-04-15 06:09:15,619 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 06:09:15,620 INFO L912 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-04-15 06:09:15,620 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04-15 06:09:15,621 INFO L914 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-04-15 06:09:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 06:09:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-15 06:09:15,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:15,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second 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-04-15 06:09:15,707 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second 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-04-15 06:09:15,707 INFO L87 Difference]: Start difference. First operand 64 states. Second 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-04-15 06:09:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:15,710 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-15 06:09:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-15 06:09:15,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:15,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:15,711 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 64 states. [2022-04-15 06:09:15,712 INFO L87 Difference]: Start difference. First 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) Second operand 64 states. [2022-04-15 06:09:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:15,714 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-15 06:09:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-15 06:09:15,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:15,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:15,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:15,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:15,716 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-04-15 06:09:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-15 06:09:15,718 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2022-04-15 06:09:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:15,719 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-15 06:09:15,719 INFO L479 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-04-15 06:09:15,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-15 06:09:15,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-15 06:09:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:09:15,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:15,809 INFO L499 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-04-15 06:09:15,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:09:15,809 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2022-04-15 06:09:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:15,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28219252] [2022-04-15 06:09:15,810 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:09:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 2 times [2022-04-15 06:09:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:15,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208309800] [2022-04-15 06:09:15,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {1953#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1920#true} is VALID [2022-04-15 06:09:15,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1920#true} {1920#true} #126#return; {1920#true} is VALID [2022-04-15 06:09:15,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 06:09:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #94#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 06:09:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #96#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 06:09:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #98#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 06:09:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #100#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:09:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #102#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 06:09:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #104#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {1920#true} call ULTIMATE.init(); {1953#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:15,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {1953#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1920#true} is VALID [2022-04-15 06:09:15,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1920#true} #126#return; {1920#true} is VALID [2022-04-15 06:09:15,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {1920#true} call #t~ret11 := main(); {1920#true} is VALID [2022-04-15 06:09:15,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {1920#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {1920#true} is VALID [2022-04-15 06:09:15,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {1920#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {1920#true} is VALID [2022-04-15 06:09:15,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {1920#true} assume !!(~i~0 < ~len~0);~j~0 := 0; {1920#true} is VALID [2022-04-15 06:09:15,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {1920#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1920#true} is VALID [2022-04-15 06:09:15,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {1920#true} assume 1 + ~i~0 < ~len~0; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,930 INFO L272 TraceCheckUtils]: 10: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {1920#true} is VALID [2022-04-15 06:09:15,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,931 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #94#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,932 INFO L272 TraceCheckUtils]: 15: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1920#true} is VALID [2022-04-15 06:09:15,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,933 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #96#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,934 INFO L272 TraceCheckUtils]: 22: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1920#true} is VALID [2022-04-15 06:09:15,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,935 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #98#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,935 INFO L272 TraceCheckUtils]: 27: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1920#true} is VALID [2022-04-15 06:09:15,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,936 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #100#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,936 INFO L272 TraceCheckUtils]: 32: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1920#true} is VALID [2022-04-15 06:09:15,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,940 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #102#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,941 INFO L272 TraceCheckUtils]: 37: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {1920#true} is VALID [2022-04-15 06:09:15,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {1920#true} ~cond := #in~cond; {1920#true} is VALID [2022-04-15 06:09:15,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {1920#true} assume !(0 == ~cond); {1920#true} is VALID [2022-04-15 06:09:15,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {1920#true} assume true; {1920#true} is VALID [2022-04-15 06:09:15,942 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1920#true} {1925#(<= (+ main_~i~0 2) main_~len~0)} #104#return; {1925#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 06:09:15,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {1925#(<= (+ main_~i~0 2) main_~len~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1950#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2022-04-15 06:09:15,943 INFO L272 TraceCheckUtils]: 43: Hoare triple {1950#(<= (+ main_~i~0 1) main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:15,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {1951#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1952#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:15,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {1952#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1921#false} is VALID [2022-04-15 06:09:15,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {1921#false} assume !false; {1921#false} is VALID [2022-04-15 06:09:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 06:09:15,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:15,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208309800] [2022-04-15 06:09:15,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208309800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:15,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:15,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:09:15,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:15,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28219252] [2022-04-15 06:09:15,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28219252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:15,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:15,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:09:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543167949] [2022-04-15 06:09:15,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:15,947 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-04-15 06:09:15,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:15,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 06:09:15,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:15,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:09:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:09:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:09:15,980 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-04-15 06:09:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:16,757 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-15 06:09:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:09:16,758 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-04-15 06:09:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-15 06:09:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-15 06:09:16,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2022-04-15 06:09:16,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:16,866 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:09:16,867 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 06:09:16,867 INFO L912 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-04-15 06:09:16,868 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:16,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:09:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 06:09:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-04-15 06:09:16,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:16,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second 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-04-15 06:09:16,966 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second 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-04-15 06:09:16,967 INFO L87 Difference]: Start difference. First operand 73 states. Second 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-04-15 06:09:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:16,970 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-15 06:09:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-15 06:09:16,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:16,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:16,971 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 73 states. [2022-04-15 06:09:16,971 INFO L87 Difference]: Start difference. First 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) Second operand 73 states. [2022-04-15 06:09:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:16,974 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-15 06:09:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-15 06:09:16,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:16,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:16,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:16,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:16,975 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-04-15 06:09:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-15 06:09:16,977 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2022-04-15 06:09:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:16,978 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-15 06:09:16,978 INFO L479 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-04-15 06:09:16,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2022-04-15 06:09:17,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-15 06:09:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 06:09:17,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:17,072 INFO L499 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-04-15 06:09:17,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:09:17,072 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2022-04-15 06:09:17,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:17,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083209208] [2022-04-15 06:09:17,073 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:09:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 2 times [2022-04-15 06:09:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:17,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345192978] [2022-04-15 06:09:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {2440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2398#true} is VALID [2022-04-15 06:09:17,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2398#true} {2398#true} #126#return; {2398#true} is VALID [2022-04-15 06:09:17,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 06:09:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #94#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 06:09:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #96#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 06:09:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #98#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 06:09:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #100#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:09:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #102#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 06:09:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #104#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:09:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:09:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:17,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {2398#true} call ULTIMATE.init(); {2440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:17,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2398#true} is VALID [2022-04-15 06:09:17,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2398#true} {2398#true} #126#return; {2398#true} is VALID [2022-04-15 06:09:17,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {2398#true} call #t~ret11 := main(); {2398#true} is VALID [2022-04-15 06:09:17,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {2398#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {2398#true} is VALID [2022-04-15 06:09:17,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {2398#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {2403#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {2403#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {2403#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {2403#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume 1 + ~i~0 < ~len~0; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,249 INFO L272 TraceCheckUtils]: 10: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {2398#true} is VALID [2022-04-15 06:09:17,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,250 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #94#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,250 INFO L272 TraceCheckUtils]: 15: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2398#true} is VALID [2022-04-15 06:09:17,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,251 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #96#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,252 INFO L272 TraceCheckUtils]: 22: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2398#true} is VALID [2022-04-15 06:09:17,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,253 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #98#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,253 INFO L272 TraceCheckUtils]: 27: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2398#true} is VALID [2022-04-15 06:09:17,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,254 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #100#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,254 INFO L272 TraceCheckUtils]: 32: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2398#true} is VALID [2022-04-15 06:09:17,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,255 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #102#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,255 INFO L272 TraceCheckUtils]: 37: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2398#true} is VALID [2022-04-15 06:09:17,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,256 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2398#true} {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #104#return; {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {2404#(<= (+ 5 main_~j~0) main_~bufsize~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,257 INFO L272 TraceCheckUtils]: 43: Hoare triple {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2398#true} is VALID [2022-04-15 06:09:17,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,258 INFO L290 TraceCheckUtils]: 46: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,258 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2398#true} {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,258 INFO L272 TraceCheckUtils]: 48: Hoare triple {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2398#true} is VALID [2022-04-15 06:09:17,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {2398#true} ~cond := #in~cond; {2398#true} is VALID [2022-04-15 06:09:17,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {2398#true} assume !(0 == ~cond); {2398#true} is VALID [2022-04-15 06:09:17,259 INFO L290 TraceCheckUtils]: 51: Hoare triple {2398#true} assume true; {2398#true} is VALID [2022-04-15 06:09:17,259 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2398#true} {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:17,260 INFO L272 TraceCheckUtils]: 53: Hoare triple {2429#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2438#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:17,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {2438#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2439#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:17,261 INFO L290 TraceCheckUtils]: 55: Hoare triple {2439#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2399#false} is VALID [2022-04-15 06:09:17,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {2399#false} assume !false; {2399#false} is VALID [2022-04-15 06:09:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 06:09:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:17,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345192978] [2022-04-15 06:09:17,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345192978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:17,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:17,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:09:17,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:17,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083209208] [2022-04-15 06:09:17,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083209208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:17,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:17,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:09:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621995064] [2022-04-15 06:09:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:17,263 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-04-15 06:09:17,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:17,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 06:09:17,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:17,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:09:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:17,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:09:17,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:09:17,292 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-04-15 06:09:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:18,090 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-04-15 06:09:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:09:18,091 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-04-15 06:09:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 06:09:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 06:09:18,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-15 06:09:18,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:18,163 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:09:18,163 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 06:09:18,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:09:18,164 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:18,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:09:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 06:09:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-15 06:09:18,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:18,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second 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-04-15 06:09:18,277 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second 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-04-15 06:09:18,277 INFO L87 Difference]: Start difference. First operand 73 states. Second 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-04-15 06:09:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:18,280 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-15 06:09:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-15 06:09:18,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:18,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:18,281 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 73 states. [2022-04-15 06:09:18,281 INFO L87 Difference]: Start difference. First 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) Second operand 73 states. [2022-04-15 06:09:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:18,285 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-15 06:09:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-15 06:09:18,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:18,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:18,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:18,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:18,286 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-04-15 06:09:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-04-15 06:09:18,289 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2022-04-15 06:09:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:18,289 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-04-15 06:09:18,289 INFO L479 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-04-15 06:09:18,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 82 transitions. [2022-04-15 06:09:18,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-15 06:09:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 06:09:18,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:18,389 INFO L499 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-04-15 06:09:18,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 06:09:18,390 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2022-04-15 06:09:18,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:18,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1522768400] [2022-04-15 06:09:18,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:09:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 2 times [2022-04-15 06:09:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:18,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683967527] [2022-04-15 06:09:18,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:18,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {2945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2894#true} is VALID [2022-04-15 06:09:18,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2894#true} {2894#true} #126#return; {2894#true} is VALID [2022-04-15 06:09:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 06:09:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #94#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 06:09:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #96#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 06:09:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #98#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 06:09:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #100#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 06:09:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #102#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 06:09:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #104#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 06:09:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 06:09:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 06:09:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #110#return; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 06:09:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:18,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #112#return; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {2894#true} call ULTIMATE.init(); {2945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:18,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {2945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2894#true} is VALID [2022-04-15 06:09:18,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2894#true} #126#return; {2894#true} is VALID [2022-04-15 06:09:18,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {2894#true} call #t~ret11 := main(); {2894#true} is VALID [2022-04-15 06:09:18,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {2894#true} havoc ~len~0;havoc ~i~0;havoc ~j~0;havoc ~bufsize~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~bufsize~0 := #t~nondet1;havoc #t~nondet1; {2894#true} is VALID [2022-04-15 06:09:18,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {2894#true} assume !(~bufsize~0 < 0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~len~0 := #t~nondet2;havoc #t~nondet2;~limit~0 := ~bufsize~0 - 4;~i~0 := 0; {2899#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0);~j~0 := 0; {2899#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {2899#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume 1 + ~i~0 < ~len~0; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,616 INFO L272 TraceCheckUtils]: 10: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,618 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #94#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,618 INFO L272 TraceCheckUtils]: 15: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,626 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #96#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,627 INFO L272 TraceCheckUtils]: 22: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,628 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #98#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,628 INFO L272 TraceCheckUtils]: 27: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,636 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #100#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,636 INFO L272 TraceCheckUtils]: 32: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,637 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #102#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,637 INFO L272 TraceCheckUtils]: 37: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,638 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2894#true} {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #104#return; {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {2900#(<= (+ 5 main_~j~0) main_~bufsize~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,639 INFO L272 TraceCheckUtils]: 43: Hoare triple {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,652 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2894#true} {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #106#return; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,652 INFO L272 TraceCheckUtils]: 48: Hoare triple {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,653 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2894#true} {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #108#return; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,653 INFO L272 TraceCheckUtils]: 53: Hoare triple {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,654 INFO L290 TraceCheckUtils]: 55: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,654 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2894#true} {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #110#return; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,655 INFO L272 TraceCheckUtils]: 58: Hoare triple {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2894#true} is VALID [2022-04-15 06:09:18,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {2894#true} ~cond := #in~cond; {2894#true} is VALID [2022-04-15 06:09:18,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {2894#true} assume !(0 == ~cond); {2894#true} is VALID [2022-04-15 06:09:18,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {2894#true} assume true; {2894#true} is VALID [2022-04-15 06:09:18,656 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2894#true} {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #112#return; {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {2925#(<= (+ main_~j~0 4) main_~bufsize~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6;#t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2942#(<= (+ main_~j~0 3) main_~bufsize~0)} is VALID [2022-04-15 06:09:18,657 INFO L272 TraceCheckUtils]: 64: Hoare triple {2942#(<= (+ main_~j~0 3) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2943#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:18,658 INFO L290 TraceCheckUtils]: 65: Hoare triple {2943#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2944#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:18,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {2944#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2895#false} is VALID [2022-04-15 06:09:18,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {2895#false} assume !false; {2895#false} is VALID [2022-04-15 06:09:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 06:09:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683967527] [2022-04-15 06:09:18,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683967527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:18,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:18,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:09:18,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:18,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1522768400] [2022-04-15 06:09:18,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1522768400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:18,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:18,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:09:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789496368] [2022-04-15 06:09:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:18,661 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-04-15 06:09:18,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:18,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 06:09:18,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:18,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:09:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:09:18,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:09:18,707 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-04-15 06:09:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:19,514 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-15 06:09:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:09:19,515 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-04-15 06:09:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 06:09:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 06:09:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 06:09:19,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-15 06:09:19,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:19,596 INFO L225 Difference]: With dead ends: 73 [2022-04-15 06:09:19,596 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:09:19,600 INFO L912 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-04-15 06:09:19,601 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:19,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 61 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:09:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:09:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:09:19,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:19,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-04-15 06:09:19,602 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-04-15 06:09:19,603 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-04-15 06:09:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:19,603 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:09:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:09:19,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:19,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:19,603 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-15 06:09:19,603 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-15 06:09:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:19,604 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:09:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:09:19,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:19,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:19,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:19,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:19,604 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-04-15 06:09:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:09:19,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-04-15 06:09:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:19,605 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:09:19,605 INFO L479 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-04-15 06:09:19,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:09:19,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:09:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:09:19,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:19,607 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:09:19,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 06:09:19,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:09:20,248 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 06:09:20,248 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 06:09:20,248 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 06:09:20,249 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-15 06:09:20,249 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:09:20,249 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:09:20,249 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:09:20,249 INFO L878 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-04-15 06:09:20,249 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-04-15 06:09:20,249 INFO L878 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-04-15 06:09:20,249 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 67) the Hoare annotation is: true [2022-04-15 06:09:20,250 INFO L878 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-04-15 06:09:20,250 INFO L878 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-04-15 06:09:20,250 INFO L878 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-04-15 06:09:20,250 INFO L878 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-04-15 06:09:20,250 INFO L878 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-04-15 06:09:20,250 INFO L878 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-04-15 06:09:20,250 INFO L878 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-04-15 06:09:20,250 INFO L878 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-04-15 06:09:20,251 INFO L878 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-04-15 06:09:20,251 INFO L878 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-04-15 06:09:20,251 INFO L878 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-04-15 06:09:20,251 INFO L878 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-04-15 06:09:20,251 INFO L878 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-04-15 06:09:20,251 INFO L878 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-04-15 06:09:20,251 INFO L878 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-04-15 06:09:20,251 INFO L878 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-04-15 06:09:20,251 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 67) the Hoare annotation is: true [2022-04-15 06:09:20,252 INFO L878 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-04-15 06:09:20,252 INFO L878 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-04-15 06:09:20,252 INFO L878 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-04-15 06:09:20,252 INFO L885 garLoopResultBuilder]: At program point L34-3(lines 34 65) the Hoare annotation is: true [2022-04-15 06:09:20,252 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2022-04-15 06:09:20,252 INFO L878 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-04-15 06:09:20,252 INFO L878 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-04-15 06:09:20,252 INFO L878 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-04-15 06:09:20,252 INFO L878 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-04-15 06:09:20,253 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:09:20,253 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 06:09:20,253 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:09:20,253 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:09:20,253 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:09:20,253 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:09:20,253 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:09:20,253 INFO L878 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-04-15 06:09:20,253 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 06:09:20,253 INFO L878 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-04-15 06:09:20,253 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 06:09:20,254 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 06:09:20,254 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 06:09:20,257 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 06:09:20,258 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:09:20,261 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:09:20,261 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:09:20,262 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 06:09:20,262 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 06:09:20,262 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:09:20,262 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:09:20,263 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 06:09:20,292 INFO L163 areAnnotationChecker]: CFG has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:09:20,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:09:20 BoogieIcfgContainer [2022-04-15 06:09:20,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:09:20,304 INFO L158 Benchmark]: Toolchain (without parser) took 11618.02ms. Allocated memory was 174.1MB in the beginning and 286.3MB in the end (delta: 112.2MB). Free memory was 148.1MB in the beginning and 230.8MB in the end (delta: -82.7MB). Peak memory consumption was 160.9MB. Max. memory is 8.0GB. [2022-04-15 06:09:20,304 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:09:20,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.48ms. Allocated memory is still 174.1MB. Free memory was 147.8MB in the beginning and 145.7MB in the end (delta: 2.2MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-15 06:09:20,305 INFO L158 Benchmark]: Boogie Preprocessor took 77.09ms. Allocated memory is still 174.1MB. Free memory was 145.7MB in the beginning and 144.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:09:20,305 INFO L158 Benchmark]: RCFGBuilder took 631.67ms. Allocated memory is still 174.1MB. Free memory was 144.3MB in the beginning and 129.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-15 06:09:20,306 INFO L158 Benchmark]: TraceAbstraction took 10427.47ms. Allocated memory was 174.1MB in the beginning and 286.3MB in the end (delta: 112.2MB). Free memory was 128.9MB in the beginning and 230.8MB in the end (delta: -101.9MB). Peak memory consumption was 141.9MB. Max. memory is 8.0GB. [2022-04-15 06:09:20,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.48ms. Allocated memory is still 174.1MB. Free memory was 147.8MB in the beginning and 145.7MB in the end (delta: 2.2MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.09ms. Allocated memory is still 174.1MB. Free memory was 145.7MB in the beginning and 144.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 631.67ms. Allocated memory is still 174.1MB. Free memory was 144.3MB in the beginning and 129.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10427.47ms. Allocated memory was 174.1MB in the beginning and 286.3MB in the end (delta: 112.2MB). Free memory was 128.9MB in the beginning and 230.8MB in the end (delta: -101.9MB). Peak memory consumption was 141.9MB. 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: 10.3s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 464 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1517 IncrementalHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 294 mSDtfsCounter, 1517 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.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 235 PreInvPairs, 302 NumberOfFragments, 561 HoareAnnotationTreeSize, 235 FomulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 43 FomulaSimplificationsInter, 581 FormulaSimplificationTreeSizeReductionInter, 0.3s 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-04-15 06:09:20,344 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...