/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/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:12:18,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:12:18,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:12:19,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:12:19,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:12:19,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:12:19,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:12:19,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:12:19,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:12:19,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:12:19,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:12:19,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:12:19,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:12:19,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:12:19,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:12:19,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:12:19,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:12:19,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:12:19,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:12:19,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:12:19,014 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:12:19,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:12:19,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:12:19,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:12:19,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:12:19,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:12:19,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:12:19,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:12:19,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:12:19,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:12:19,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:12:19,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:12:19,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:12:19,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:12:19,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:12:19,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:12:19,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:12:19,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:12:19,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:12:19,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:12:19,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:12:19,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:12:19,040 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:12:19,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:12:19,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:12:19,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:12:19,053 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:12:19,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:12:19,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:12:19,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:12:19,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:12:19,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:12:19,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:12:19,054 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:12:19,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:12:19,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:12:19,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:12:19,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:12:19,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:12:19,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:12:19,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:12:19,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:19,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:12:19,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:12:19,055 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:12:19,056 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:12:19,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:12:19,056 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:12:19,056 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:12:19,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:12:19,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:12:19,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:12:19,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:12:19,280 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:12:19,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-04-15 06:12:19,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659bb2826/a274fed397234f699c68df253fee301c/FLAG117149dbd [2022-04-15 06:12:19,698 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:12:19,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-04-15 06:12:19,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659bb2826/a274fed397234f699c68df253fee301c/FLAG117149dbd [2022-04-15 06:12:19,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659bb2826/a274fed397234f699c68df253fee301c [2022-04-15 06:12:19,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:12:19,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:12:19,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:19,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:12:19,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:12:19,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:19,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b65c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19, skipping insertion in model container [2022-04-15 06:12:19,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:19,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:12:19,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:12:19,903 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/sendmail-close-angle.i[893,906] [2022-04-15 06:12:19,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:19,936 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:12:19,949 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/sendmail-close-angle.i[893,906] [2022-04-15 06:12:19,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:19,973 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:12:19,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19 WrapperNode [2022-04-15 06:12:19,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:19,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:12:19,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:12:19,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:12:19,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:19,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:19,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:19,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:20,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:20,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:20,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:20,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:12:20,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:12:20,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:12:20,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:12:20,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (1/1) ... [2022-04-15 06:12:20,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:20,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:20,054 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:12:20,079 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:12:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:12:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:12:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:12:20,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:12:20,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:12:20,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:12:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:12:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:12:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:12:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:12:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:12:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:12:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:12:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:12:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:12:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:12:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:12:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:12:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:12:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:12:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:12:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:12:20,185 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:12:20,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:12:20,418 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:12:20,423 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:12:20,423 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:12:20,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:20 BoogieIcfgContainer [2022-04-15 06:12:20,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:12:20,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:12:20,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:12:20,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:12:20,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:12:19" (1/3) ... [2022-04-15 06:12:20,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da89231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:20, skipping insertion in model container [2022-04-15 06:12:20,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:19" (2/3) ... [2022-04-15 06:12:20,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da89231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:20, skipping insertion in model container [2022-04-15 06:12:20,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:20" (3/3) ... [2022-04-15 06:12:20,436 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2022-04-15 06:12:20,440 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:12:20,441 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:12:20,490 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:12:20,498 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:12:20,498 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:12:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 06:12:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:12:20,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:20,527 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:20,527 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 1 times [2022-04-15 06:12:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:20,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042622930] [2022-04-15 06:12:20,546 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 2 times [2022-04-15 06:12:20,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:20,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150428570] [2022-04-15 06:12:20,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:20,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:20,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(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); {39#true} is VALID [2022-04-15 06:12:20,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 06:12:20,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #102#return; {39#true} is VALID [2022-04-15 06:12:20,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:20,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(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); {39#true} is VALID [2022-04-15 06:12:20,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 06:12:20,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #102#return; {39#true} is VALID [2022-04-15 06:12:20,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret8 := main(); {39#true} is VALID [2022-04-15 06:12:20,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~in~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~inlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufferlen~0 := #t~nondet2;havoc #t~nondet2;havoc ~buf~0;havoc ~buflim~0; {39#true} is VALID [2022-04-15 06:12:20,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume ~bufferlen~0 > 1; {39#true} is VALID [2022-04-15 06:12:20,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} assume ~inlen~0 > 0; {39#true} is VALID [2022-04-15 06:12:20,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume ~bufferlen~0 < ~inlen~0; {39#true} is VALID [2022-04-15 06:12:20,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#true} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {39#true} is VALID [2022-04-15 06:12:20,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-04-15 06:12:20,730 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#false} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {40#false} is VALID [2022-04-15 06:12:20,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-15 06:12:20,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-15 06:12:20,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-15 06:12:20,731 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:12:20,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:20,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150428570] [2022-04-15 06:12:20,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150428570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:20,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:20,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:20,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:20,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2042622930] [2022-04-15 06:12:20,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2042622930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:20,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:20,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677821929] [2022-04-15 06:12:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:20,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-04-15 06:12:20,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:20,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:12:20,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:20,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:12:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:20,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:12:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:12:20,787 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:12:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:20,959 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2022-04-15 06:12:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:12:20,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-04-15 06:12:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:12:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-15 06:12:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:12:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-15 06:12:20,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-04-15 06:12:21,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:21,116 INFO L225 Difference]: With dead ends: 62 [2022-04-15 06:12:21,116 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:12:21,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:12:21,123 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:21,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:12:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 06:12:21,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:21,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:12:21,168 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:12:21,168 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:12:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:21,173 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 06:12:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 06:12:21,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:21,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:21,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-15 06:12:21,175 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-15 06:12:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:21,182 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 06:12:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 06:12:21,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:21,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:21,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:21,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:12:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-15 06:12:21,195 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2022-04-15 06:12:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:21,200 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-15 06:12:21,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:12:21,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 38 transitions. [2022-04-15 06:12:21,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 06:12:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:12:21,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:21,250 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:21,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:12:21,250 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 1 times [2022-04-15 06:12:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:21,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1569905012] [2022-04-15 06:12:21,252 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 2 times [2022-04-15 06:12:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:21,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358834586] [2022-04-15 06:12:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:21,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {299#(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); {291#true} is VALID [2022-04-15 06:12:21,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-15 06:12:21,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291#true} {291#true} #102#return; {291#true} is VALID [2022-04-15 06:12:21,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:21,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {299#(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); {291#true} is VALID [2022-04-15 06:12:21,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-15 06:12:21,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #102#return; {291#true} is VALID [2022-04-15 06:12:21,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret8 := main(); {291#true} is VALID [2022-04-15 06:12:21,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {291#true} havoc ~in~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~inlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufferlen~0 := #t~nondet2;havoc #t~nondet2;havoc ~buf~0;havoc ~buflim~0; {291#true} is VALID [2022-04-15 06:12:21,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#true} assume ~bufferlen~0 > 1; {291#true} is VALID [2022-04-15 06:12:21,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#true} assume ~inlen~0 > 0; {291#true} is VALID [2022-04-15 06:12:21,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#true} assume ~bufferlen~0 < ~inlen~0; {291#true} is VALID [2022-04-15 06:12:21,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#true} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {296#(<= 0 main_~buf~0)} is VALID [2022-04-15 06:12:21,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(<= 0 main_~buf~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {296#(<= 0 main_~buf~0)} is VALID [2022-04-15 06:12:21,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#(<= 0 main_~buf~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {296#(<= 0 main_~buf~0)} is VALID [2022-04-15 06:12:21,387 INFO L272 TraceCheckUtils]: 12: Hoare triple {296#(<= 0 main_~buf~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {297#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:21,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {298#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:21,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {298#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {292#false} is VALID [2022-04-15 06:12:21,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-15 06:12:21,389 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:12:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:21,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358834586] [2022-04-15 06:12:21,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358834586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:21,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:21,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:12:21,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:21,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1569905012] [2022-04-15 06:12:21,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1569905012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:21,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:21,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:12:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145983456] [2022-04-15 06:12:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:21,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-15 06:12:21,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:21,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:21,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:21,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:12:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:21,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:12:21,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:12:21,406 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:21,739 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 06:12:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:12:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-15 06:12:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-15 06:12:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-15 06:12:21,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-15 06:12:21,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:21,791 INFO L225 Difference]: With dead ends: 36 [2022-04-15 06:12:21,791 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:12:21,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:12:21,792 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:21,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:12:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:12:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 06:12:21,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:21,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:12:21,812 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:12:21,813 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:12:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:21,814 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 06:12:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 06:12:21,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:21,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:21,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-15 06:12:21,816 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-15 06:12:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:21,818 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 06:12:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 06:12:21,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:21,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:21,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:21,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 06:12:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-15 06:12:21,820 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2022-04-15 06:12:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:21,820 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-15 06:12:21,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:12:21,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 41 transitions. [2022-04-15 06:12:21,858 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:12:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 06:12:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:12:21,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:21,861 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:21,861 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:12:21,861 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:21,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 1 times [2022-04-15 06:12:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:21,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [551824067] [2022-04-15 06:12:21,866 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 2 times [2022-04-15 06:12:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:21,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789591805] [2022-04-15 06:12:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:21,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:21,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#(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); {518#true} is VALID [2022-04-15 06:12:21,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-15 06:12:21,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #102#return; {518#true} is VALID [2022-04-15 06:12:21,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 06:12:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:21,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {518#true} ~cond := #in~cond; {518#true} is VALID [2022-04-15 06:12:21,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} assume !(0 == ~cond); {518#true} is VALID [2022-04-15 06:12:21,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-15 06:12:21,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {524#(< main_~buf~0 main_~bufferlen~0)} #94#return; {524#(< main_~buf~0 main_~bufferlen~0)} is VALID [2022-04-15 06:12:21,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:21,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#(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); {518#true} is VALID [2022-04-15 06:12:21,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-15 06:12:21,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #102#return; {518#true} is VALID [2022-04-15 06:12:21,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret8 := main(); {518#true} is VALID [2022-04-15 06:12:21,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} havoc ~in~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~inlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufferlen~0 := #t~nondet2;havoc #t~nondet2;havoc ~buf~0;havoc ~buflim~0; {518#true} is VALID [2022-04-15 06:12:21,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {518#true} assume ~bufferlen~0 > 1; {523#(<= 2 main_~bufferlen~0)} is VALID [2022-04-15 06:12:21,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {523#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {523#(<= 2 main_~bufferlen~0)} is VALID [2022-04-15 06:12:21,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {523#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {523#(<= 2 main_~bufferlen~0)} is VALID [2022-04-15 06:12:21,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {523#(<= 2 main_~bufferlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {524#(< main_~buf~0 main_~bufferlen~0)} is VALID [2022-04-15 06:12:21,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#(< main_~buf~0 main_~bufferlen~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {524#(< main_~buf~0 main_~bufferlen~0)} is VALID [2022-04-15 06:12:21,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#(< main_~buf~0 main_~bufferlen~0)} assume !(0 != #t~nondet3);havoc #t~nondet3; {524#(< main_~buf~0 main_~bufferlen~0)} is VALID [2022-04-15 06:12:21,969 INFO L272 TraceCheckUtils]: 12: Hoare triple {524#(< main_~buf~0 main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {518#true} is VALID [2022-04-15 06:12:21,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {518#true} ~cond := #in~cond; {518#true} is VALID [2022-04-15 06:12:21,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#true} assume !(0 == ~cond); {518#true} is VALID [2022-04-15 06:12:21,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-15 06:12:21,970 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {518#true} {524#(< main_~buf~0 main_~bufferlen~0)} #94#return; {524#(< main_~buf~0 main_~bufferlen~0)} is VALID [2022-04-15 06:12:21,970 INFO L272 TraceCheckUtils]: 17: Hoare triple {524#(< main_~buf~0 main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:21,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {529#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {530#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:21,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {530#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {519#false} is VALID [2022-04-15 06:12:21,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-04-15 06:12:21,972 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:12:21,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:21,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789591805] [2022-04-15 06:12:21,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789591805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:21,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:21,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:12:21,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:21,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [551824067] [2022-04-15 06:12:21,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [551824067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:21,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:21,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:12:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673487431] [2022-04-15 06:12:21,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2022-04-15 06:12:21,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:21,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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:12:21,988 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:12:21,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:12:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:21,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:12:21,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:12:21,989 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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:12:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:22,429 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-15 06:12:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:12:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2022-04-15 06:12:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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:12:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 06:12:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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:12:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 06:12:22,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-15 06:12:22,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:22,479 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:12:22,479 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:12:22,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:12:22,480 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:22,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:12:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:12:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-04-15 06:12:22,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:22,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:12:22,513 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:12:22,513 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:12:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:22,515 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-15 06:12:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-15 06:12:22,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:22,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:22,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 47 states. [2022-04-15 06:12:22,517 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 47 states. [2022-04-15 06:12:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:22,519 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-15 06:12:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-15 06:12:22,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:22,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:22,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:22,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:12:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-15 06:12:22,521 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2022-04-15 06:12:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:22,522 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-15 06:12:22,522 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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:12:22,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 57 transitions. [2022-04-15 06:12:22,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-15 06:12:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:12:22,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:22,587 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, 1, 1, 1, 1, 1] [2022-04-15 06:12:22,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:12:22,589 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 1 times [2022-04-15 06:12:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513711786] [2022-04-15 06:12:22,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 2 times [2022-04-15 06:12:22,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:22,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448323794] [2022-04-15 06:12:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:22,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#(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); {826#true} is VALID [2022-04-15 06:12:22,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-15 06:12:22,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {826#true} {826#true} #102#return; {826#true} is VALID [2022-04-15 06:12:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 06:12:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:22,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-15 06:12:22,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-15 06:12:22,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-15 06:12:22,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {831#(= main_~in~0 0)} #86#return; {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 06:12:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:22,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-15 06:12:22,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-15 06:12:22,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-15 06:12:22,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {831#(= main_~in~0 0)} #88#return; {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {826#true} call ULTIMATE.init(); {843#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:22,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#(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); {826#true} is VALID [2022-04-15 06:12:22,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-15 06:12:22,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {826#true} #102#return; {826#true} is VALID [2022-04-15 06:12:22,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {826#true} call #t~ret8 := main(); {826#true} is VALID [2022-04-15 06:12:22,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {826#true} havoc ~in~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~inlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufferlen~0 := #t~nondet2;havoc #t~nondet2;havoc ~buf~0;havoc ~buflim~0; {826#true} is VALID [2022-04-15 06:12:22,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#true} assume ~bufferlen~0 > 1; {826#true} is VALID [2022-04-15 06:12:22,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#true} assume ~inlen~0 > 0; {826#true} is VALID [2022-04-15 06:12:22,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#true} assume ~bufferlen~0 < ~inlen~0; {826#true} is VALID [2022-04-15 06:12:22,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#true} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {831#(= main_~in~0 0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {831#(= main_~in~0 0)} assume !!(0 != #t~nondet3);havoc #t~nondet3; {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(= main_~in~0 0)} assume !(~buf~0 == ~buflim~0); {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,702 INFO L272 TraceCheckUtils]: 13: Hoare triple {831#(= main_~in~0 0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {826#true} is VALID [2022-04-15 06:12:22,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-15 06:12:22,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-15 06:12:22,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-15 06:12:22,703 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {826#true} {831#(= main_~in~0 0)} #86#return; {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,703 INFO L272 TraceCheckUtils]: 18: Hoare triple {831#(= main_~in~0 0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {826#true} is VALID [2022-04-15 06:12:22,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-15 06:12:22,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-15 06:12:22,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-15 06:12:22,704 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {826#true} {831#(= main_~in~0 0)} #88#return; {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {831#(= main_~in~0 0)} #t~post4 := ~buf~0;~buf~0 := 1 + #t~post4;havoc #t~post4; {831#(= main_~in~0 0)} is VALID [2022-04-15 06:12:22,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {831#(= main_~in~0 0)} #t~post5 := ~in~0;~in~0 := 1 + #t~post5;havoc #t~post5; {840#(<= 1 main_~in~0)} is VALID [2022-04-15 06:12:22,706 INFO L272 TraceCheckUtils]: 25: Hoare triple {840#(<= 1 main_~in~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {841#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:22,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {841#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {842#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:22,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {842#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {827#false} is VALID [2022-04-15 06:12:22,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {827#false} assume !false; {827#false} is VALID [2022-04-15 06:12:22,710 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:12:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448323794] [2022-04-15 06:12:22,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448323794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:22,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:22,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:12:22,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:22,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1513711786] [2022-04-15 06:12:22,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1513711786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:22,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:22,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:12:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691302782] [2022-04-15 06:12:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 29 [2022-04-15 06:12:22,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:22,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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:12:22,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:22,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:12:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:22,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:12:22,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:12:22,742 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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:12:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:23,281 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-15 06:12:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:12:23,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 29 [2022-04-15 06:12:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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:12:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 06:12:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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:12:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 06:12:23,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 06:12:23,348 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:12:23,349 INFO L225 Difference]: With dead ends: 56 [2022-04-15 06:12:23,349 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 06:12:23,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:12:23,350 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:23,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:12:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 06:12:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-04-15 06:12:23,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:23,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:12:23,413 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:12:23,414 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:12:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:23,416 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-15 06:12:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-15 06:12:23,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:23,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:23,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 54 states. [2022-04-15 06:12:23,417 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 54 states. [2022-04-15 06:12:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:23,419 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-15 06:12:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-15 06:12:23,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:23,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:23,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:23,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 06:12:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-04-15 06:12:23,423 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2022-04-15 06:12:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:23,423 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-04-15 06:12:23,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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:12:23,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 60 transitions. [2022-04-15 06:12:23,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-15 06:12:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:12:23,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:23,480 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, 1, 1, 1] [2022-04-15 06:12:23,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:12:23,480 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 1 times [2022-04-15 06:12:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:23,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [185243289] [2022-04-15 06:12:23,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 2 times [2022-04-15 06:12:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:23,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288159140] [2022-04-15 06:12:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:23,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:23,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {1196#(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); {1174#true} is VALID [2022-04-15 06:12:23,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 06:12:23,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #102#return; {1174#true} is VALID [2022-04-15 06:12:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 06:12:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:23,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-15 06:12:23,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-15 06:12:23,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 06:12:23,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} #94#return; {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} is VALID [2022-04-15 06:12:23,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 06:12:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:23,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-15 06:12:23,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-15 06:12:23,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 06:12:23,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} #96#return; {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} is VALID [2022-04-15 06:12:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 06:12:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:23,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-15 06:12:23,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-15 06:12:23,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 06:12:23,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1189#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #98#return; {1189#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2022-04-15 06:12:23,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:23,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1196#(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); {1174#true} is VALID [2022-04-15 06:12:23,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 06:12:23,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #102#return; {1174#true} is VALID [2022-04-15 06:12:23,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret8 := main(); {1174#true} is VALID [2022-04-15 06:12:23,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} havoc ~in~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~inlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufferlen~0 := #t~nondet2;havoc #t~nondet2;havoc ~buf~0;havoc ~buflim~0; {1174#true} is VALID [2022-04-15 06:12:23,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#true} assume ~bufferlen~0 > 1; {1179#(<= 2 main_~bufferlen~0)} is VALID [2022-04-15 06:12:23,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1179#(<= 2 main_~bufferlen~0)} is VALID [2022-04-15 06:12:23,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {1179#(<= 2 main_~bufferlen~0)} is VALID [2022-04-15 06:12:23,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#(<= 2 main_~bufferlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} is VALID [2022-04-15 06:12:23,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} is VALID [2022-04-15 06:12:23,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} is VALID [2022-04-15 06:12:23,591 INFO L272 TraceCheckUtils]: 12: Hoare triple {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1174#true} is VALID [2022-04-15 06:12:23,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-15 06:12:23,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-15 06:12:23,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 06:12:23,592 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1174#true} {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} #94#return; {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} is VALID [2022-04-15 06:12:23,593 INFO L272 TraceCheckUtils]: 17: Hoare triple {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1174#true} is VALID [2022-04-15 06:12:23,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-15 06:12:23,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-15 06:12:23,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 06:12:23,594 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1174#true} {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} #96#return; {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} is VALID [2022-04-15 06:12:23,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {1180#(and (<= 2 main_~bufferlen~0) (= main_~buf~0 0))} #t~post6 := ~buf~0;~buf~0 := 1 + #t~post6;havoc #t~post6; {1189#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2022-04-15 06:12:23,594 INFO L272 TraceCheckUtils]: 23: Hoare triple {1189#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1174#true} is VALID [2022-04-15 06:12:23,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-15 06:12:23,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-15 06:12:23,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 06:12:23,596 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1174#true} {1189#(<= (+ main_~buf~0 1) main_~bufferlen~0)} #98#return; {1189#(<= (+ main_~buf~0 1) main_~bufferlen~0)} is VALID [2022-04-15 06:12:23,596 INFO L272 TraceCheckUtils]: 28: Hoare triple {1189#(<= (+ main_~buf~0 1) main_~bufferlen~0)} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1194#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:23,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {1194#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1195#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:23,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {1195#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1175#false} is VALID [2022-04-15 06:12:23,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-15 06:12:23,598 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:12:23,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:23,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288159140] [2022-04-15 06:12:23,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288159140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:23,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:23,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:23,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:23,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [185243289] [2022-04-15 06:12:23,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [185243289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:23,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:23,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:23,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951446296] [2022-04-15 06:12:23,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:23,600 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-15 06:12:23,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:23,600 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:23,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:23,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:12:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:12:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:23,621 INFO L87 Difference]: Start difference. First operand 49 states and 60 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:24,335 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-15 06:12:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:12:24,336 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-15 06:12:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:24,336 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-15 06:12:24,339 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-15 06:12:24,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2022-04-15 06:12:24,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:24,406 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:12:24,406 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 06:12:24,407 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:12:24,407 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:24,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 45 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:12:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 06:12:24,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-04-15 06:12:24,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:24,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:12:24,458 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:12:24,459 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:12:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:24,461 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-15 06:12:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-15 06:12:24,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:24,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:24,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 68 states. [2022-04-15 06:12:24,462 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 68 states. [2022-04-15 06:12:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:24,464 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-15 06:12:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-15 06:12:24,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:24,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:24,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:24,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:12:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-15 06:12:24,467 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2022-04-15 06:12:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:24,467 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-15 06:12:24,467 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:24,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-15 06:12:24,538 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:12:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 06:12:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:12:24,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:24,540 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, 1, 1, 1, 1, 1] [2022-04-15 06:12:24,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:12:24,540 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 1 times [2022-04-15 06:12:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:24,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285993718] [2022-04-15 06:12:24,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:24,541 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 2 times [2022-04-15 06:12:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:24,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237368782] [2022-04-15 06:12:24,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:24,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:24,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {1653#(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); {1630#true} is VALID [2022-04-15 06:12:24,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-15 06:12:24,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1630#true} {1630#true} #102#return; {1630#true} is VALID [2022-04-15 06:12:24,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 06:12:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:24,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-15 06:12:24,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-15 06:12:24,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-15 06:12:24,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#true} {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} #86#return; {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 06:12:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:24,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-15 06:12:24,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-15 06:12:24,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-15 06:12:24,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#true} {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} #88#return; {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 06:12:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:24,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-15 06:12:24,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-15 06:12:24,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-15 06:12:24,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#true} {1646#(<= (+ 2 main_~in~0) main_~inlen~0)} #90#return; {1646#(<= (+ 2 main_~in~0) main_~inlen~0)} is VALID [2022-04-15 06:12:24,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {1630#true} call ULTIMATE.init(); {1653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:24,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1653#(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); {1630#true} is VALID [2022-04-15 06:12:24,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-15 06:12:24,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#true} {1630#true} #102#return; {1630#true} is VALID [2022-04-15 06:12:24,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#true} call #t~ret8 := main(); {1630#true} is VALID [2022-04-15 06:12:24,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {1630#true} havoc ~in~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~inlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~bufferlen~0 := #t~nondet2;havoc #t~nondet2;havoc ~buf~0;havoc ~buflim~0; {1630#true} is VALID [2022-04-15 06:12:24,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {1630#true} assume ~bufferlen~0 > 1; {1635#(<= 2 main_~bufferlen~0)} is VALID [2022-04-15 06:12:24,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {1635#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1635#(<= 2 main_~bufferlen~0)} is VALID [2022-04-15 06:12:24,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {1635#(<= 2 main_~bufferlen~0)} assume ~bufferlen~0 < ~inlen~0; {1636#(<= 3 main_~inlen~0)} is VALID [2022-04-15 06:12:24,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {1636#(<= 3 main_~inlen~0)} ~buf~0 := 0;~in~0 := 0;~buflim~0 := ~bufferlen~0 - 2; {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} assume !!(0 != #t~nondet3);havoc #t~nondet3; {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} assume !(~buf~0 == ~buflim~0); {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,683 INFO L272 TraceCheckUtils]: 13: Hoare triple {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if 0 <= ~buf~0 then 1 else 0)); {1630#true} is VALID [2022-04-15 06:12:24,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-15 06:12:24,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-15 06:12:24,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-15 06:12:24,684 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1630#true} {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} #86#return; {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,685 INFO L272 TraceCheckUtils]: 18: Hoare triple {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} call __VERIFIER_assert((if ~buf~0 < ~bufferlen~0 then 1 else 0)); {1630#true} is VALID [2022-04-15 06:12:24,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-15 06:12:24,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-15 06:12:24,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-15 06:12:24,686 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1630#true} {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} #88#return; {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} #t~post4 := ~buf~0;~buf~0 := 1 + #t~post4;havoc #t~post4; {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} is VALID [2022-04-15 06:12:24,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {1637#(and (= main_~in~0 0) (<= 3 main_~inlen~0))} #t~post5 := ~in~0;~in~0 := 1 + #t~post5;havoc #t~post5; {1646#(<= (+ 2 main_~in~0) main_~inlen~0)} is VALID [2022-04-15 06:12:24,687 INFO L272 TraceCheckUtils]: 25: Hoare triple {1646#(<= (+ 2 main_~in~0) main_~inlen~0)} call __VERIFIER_assert((if 0 <= ~in~0 then 1 else 0)); {1630#true} is VALID [2022-04-15 06:12:24,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-15 06:12:24,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-15 06:12:24,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-15 06:12:24,688 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1630#true} {1646#(<= (+ 2 main_~in~0) main_~inlen~0)} #90#return; {1646#(<= (+ 2 main_~in~0) main_~inlen~0)} is VALID [2022-04-15 06:12:24,689 INFO L272 TraceCheckUtils]: 30: Hoare triple {1646#(<= (+ 2 main_~in~0) main_~inlen~0)} call __VERIFIER_assert((if ~in~0 < ~inlen~0 then 1 else 0)); {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:24,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1652#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:24,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {1652#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1631#false} is VALID [2022-04-15 06:12:24,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#false} assume !false; {1631#false} is VALID [2022-04-15 06:12:24,690 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:12:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:24,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237368782] [2022-04-15 06:12:24,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237368782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:24,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:24,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:12:24,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:24,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285993718] [2022-04-15 06:12:24,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285993718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:24,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:24,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:12:24,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756109012] [2022-04-15 06:12:24,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:24,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-15 06:12:24,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:24,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:24,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:24,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:12:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:12:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:12:24,714 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:25,418 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-15 06:12:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:12:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-15 06:12:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-15 06:12:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-15 06:12:25,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2022-04-15 06:12:25,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:25,484 INFO L225 Difference]: With dead ends: 77 [2022-04-15 06:12:25,485 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 06:12:25,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:12:25,485 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:25,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 56 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:12:25,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 06:12:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-15 06:12:25,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:25,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:12:25,555 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:12:25,555 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:12:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:25,557 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-15 06:12:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2022-04-15 06:12:25,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:25,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:25,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 75 states. [2022-04-15 06:12:25,558 INFO L87 Difference]: Start difference. First operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 75 states. [2022-04-15 06:12:25,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:25,560 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-15 06:12:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2022-04-15 06:12:25,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:25,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:25,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:25,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 06:12:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-04-15 06:12:25,563 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-04-15 06:12:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:25,563 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-04-15 06:12:25,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 06:12:25,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 82 transitions. [2022-04-15 06:12:25,632 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:12:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-15 06:12:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 06:12:25,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:25,633 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:25,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:12:25,634 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:25,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 1 times [2022-04-15 06:12:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:25,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68472417] [2022-04-15 06:12:26,614 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:12:26,615 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 06:12:26,621 INFO L158 Benchmark]: Toolchain (without parser) took 6900.52ms. Allocated memory was 179.3MB in the beginning and 272.6MB in the end (delta: 93.3MB). Free memory was 128.5MB in the beginning and 244.6MB in the end (delta: -116.2MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2022-04-15 06:12:26,622 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 144.8MB in the beginning and 144.7MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:12:26,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.45ms. Allocated memory is still 179.3MB. Free memory was 128.3MB in the beginning and 155.1MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 06:12:26,622 INFO L158 Benchmark]: Boogie Preprocessor took 41.18ms. Allocated memory is still 179.3MB. Free memory was 155.1MB in the beginning and 153.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 06:12:26,622 INFO L158 Benchmark]: RCFGBuilder took 406.98ms. Allocated memory is still 179.3MB. Free memory was 153.4MB in the beginning and 140.5MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 06:12:26,623 INFO L158 Benchmark]: TraceAbstraction took 6190.30ms. Allocated memory was 179.3MB in the beginning and 272.6MB in the end (delta: 93.3MB). Free memory was 140.0MB in the beginning and 244.6MB in the end (delta: -104.6MB). Peak memory consumption was 113.2MB. Max. memory is 8.0GB. [2022-04-15 06:12:26,623 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.12ms. Allocated memory is still 179.3MB. Free memory was 144.8MB in the beginning and 144.7MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.45ms. Allocated memory is still 179.3MB. Free memory was 128.3MB in the beginning and 155.1MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.18ms. Allocated memory is still 179.3MB. Free memory was 155.1MB in the beginning and 153.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 406.98ms. Allocated memory is still 179.3MB. Free memory was 153.4MB in the beginning and 140.5MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6190.30ms. Allocated memory was 179.3MB in the beginning and 272.6MB in the end (delta: 93.3MB). Free memory was 140.0MB in the beginning and 244.6MB in the end (delta: -104.6MB). Peak memory consumption was 113.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 06:12:26,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...