/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-34549b5 [2022-04-08 03:53:54,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:53:54,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:53:54,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:53:54,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:53:54,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:53:54,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:53:54,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:53:54,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:53:54,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:53:54,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:53:54,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:53:54,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:53:54,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:53:54,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:53:54,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:53:54,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:53:54,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:53:54,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:53:54,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:53:54,888 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:53:54,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:53:54,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:53:54,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:53:54,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:53:54,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:53:54,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:53:54,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:53:54,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:53:54,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:53:54,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:53:54,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:53:54,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:53:54,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:53:54,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:53:54,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:53:54,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:53:54,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:53:54,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:53:54,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:53:54,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:53:54,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:53:54,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:53:54,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:53:54,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:53:54,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:53:54,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:53:54,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:53:54,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:53:54,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:53:54,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:53:54,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:53:54,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:53:54,913 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:53:54,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:53:54,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:53:54,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:53:54,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:53:54,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:53:54,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:53:54,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:53:54,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:54,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:53:54,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:53:54,915 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:53:54,915 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:53:54,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:53:54,915 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:53:54,915 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-08 03:53:55,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:53:55,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:53:55,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:53:55,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:53:55,178 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:53:55,179 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-08 03:53:55,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d5eed53/b5d2881042814c49932ef34aaa854ae4/FLAG0faca4f8e [2022-04-08 03:53:55,678 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:53:55,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-04-08 03:53:55,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d5eed53/b5d2881042814c49932ef34aaa854ae4/FLAG0faca4f8e [2022-04-08 03:53:56,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d5eed53/b5d2881042814c49932ef34aaa854ae4 [2022-04-08 03:53:56,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:53:56,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:53:56,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:56,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:53:56,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:53:56,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a12ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56, skipping insertion in model container [2022-04-08 03:53:56,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:53:56,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:53:56,265 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-08 03:53:56,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:56,288 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:53:56,299 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-08 03:53:56,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:53:56,316 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:53:56,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56 WrapperNode [2022-04-08 03:53:56,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:53:56,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:53:56,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:53:56,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:53:56,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:53:56,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:53:56,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:53:56,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:53:56,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (1/1) ... [2022-04-08 03:53:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:53:56,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:53:56,382 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-08 03:53:56,388 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-08 03:53:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:53:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:53:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:53:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:53:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:53:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:53:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:53:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:53:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:53:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:53:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:53:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:53:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:53:56,485 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:53:56,487 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:53:56,742 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:53:56,748 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:53:56,748 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:53:56,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:56 BoogieIcfgContainer [2022-04-08 03:53:56,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:53:56,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:53:56,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:53:56,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:53:56,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:53:56" (1/3) ... [2022-04-08 03:53:56,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23113954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:56, skipping insertion in model container [2022-04-08 03:53:56,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:53:56" (2/3) ... [2022-04-08 03:53:56,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23113954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:53:56, skipping insertion in model container [2022-04-08 03:53:56,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:53:56" (3/3) ... [2022-04-08 03:53:56,772 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2022-04-08 03:53:56,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:53:56,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:53:56,830 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:53:56,836 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-08 03:53:56,836 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:53:56,857 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-08 03:53:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:53:56,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:56,864 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:56,865 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 1 times [2022-04-08 03:53:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:56,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429153598] [2022-04-08 03:53:56,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 2 times [2022-04-08 03:53:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:56,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954023496] [2022-04-08 03:53:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:57,144 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-08 03:53:57,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-08 03:53:57,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #102#return; {39#true} is VALID [2022-04-08 03:53:57,148 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-08 03:53:57,149 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-08 03:53:57,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-08 03:53:57,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #102#return; {39#true} is VALID [2022-04-08 03:53:57,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret8 := main(); {39#true} is VALID [2022-04-08 03:53:57,150 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-08 03:53:57,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume ~bufferlen~0 > 1; {39#true} is VALID [2022-04-08 03:53:57,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} assume ~inlen~0 > 0; {39#true} is VALID [2022-04-08 03:53:57,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume ~bufferlen~0 < ~inlen~0; {39#true} is VALID [2022-04-08 03:53:57,151 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-08 03:53:57,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-04-08 03:53:57,152 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-08 03:53:57,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-08 03:53:57,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-08 03:53:57,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-08 03:53:57,154 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-08 03:53:57,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:57,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954023496] [2022-04-08 03:53:57,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954023496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:57,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:57,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:53:57,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:57,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429153598] [2022-04-08 03:53:57,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429153598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:57,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:57,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:53:57,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758896613] [2022-04-08 03:53:57,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:57,167 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-08 03:53:57,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:57,171 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-08 03:53:57,197 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-08 03:53:57,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:53:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:57,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:53:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:53:57,227 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-08 03:53:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:57,415 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2022-04-08 03:53:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:53:57,416 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-08 03:53:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:57,417 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-08 03:53:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-08 03:53:57,427 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-08 03:53:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-08 03:53:57,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-04-08 03:53:57,551 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-08 03:53:57,565 INFO L225 Difference]: With dead ends: 62 [2022-04-08 03:53:57,566 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 03:53:57,569 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-08 03:53:57,572 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-08 03:53:57,573 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-08 03:53:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 03:53:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 03:53:57,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:57,636 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-08 03:53:57,637 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-08 03:53:57,637 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-08 03:53:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:57,642 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-08 03:53:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 03:53:57,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:57,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:57,652 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-08 03:53:57,652 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-08 03:53:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:57,656 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-08 03:53:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 03:53:57,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:57,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:57,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:57,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:57,658 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-08 03:53:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-08 03:53:57,662 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2022-04-08 03:53:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:57,662 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-08 03:53:57,663 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-08 03:53:57,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 38 transitions. [2022-04-08 03:53:57,704 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-08 03:53:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-08 03:53:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 03:53:57,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:57,705 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:53:57,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:53:57,705 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 1 times [2022-04-08 03:53:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:57,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [879513328] [2022-04-08 03:53:57,707 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 2 times [2022-04-08 03:53:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:57,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884306604] [2022-04-08 03:53:57,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:57,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:57,822 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-08 03:53:57,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-08 03:53:57,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291#true} {291#true} #102#return; {291#true} is VALID [2022-04-08 03:53:57,824 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-08 03:53:57,824 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-08 03:53:57,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-08 03:53:57,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #102#return; {291#true} is VALID [2022-04-08 03:53:57,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret8 := main(); {291#true} is VALID [2022-04-08 03:53:57,825 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-08 03:53:57,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#true} assume ~bufferlen~0 > 1; {291#true} is VALID [2022-04-08 03:53:57,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#true} assume ~inlen~0 > 0; {291#true} is VALID [2022-04-08 03:53:57,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#true} assume ~bufferlen~0 < ~inlen~0; {291#true} is VALID [2022-04-08 03:53:57,826 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-08 03:53:57,827 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-08 03:53:57,827 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-08 03:53:57,828 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-08 03:53:57,829 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-08 03:53:57,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {298#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {292#false} is VALID [2022-04-08 03:53:57,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-08 03:53:57,829 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-08 03:53:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:57,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884306604] [2022-04-08 03:53:57,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884306604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:57,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:57,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:57,831 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [879513328] [2022-04-08 03:53:57,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [879513328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:57,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:57,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:53:57,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051166648] [2022-04-08 03:53:57,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:57,833 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-08 03:53:57,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:57,833 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-08 03:53:57,851 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-08 03:53:57,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:53:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:57,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:53:57,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:53:57,852 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-08 03:53:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:58,263 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 03:53:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:53:58,263 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-08 03:53:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:58,264 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-08 03:53:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-08 03:53:58,266 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-08 03:53:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-08 03:53:58,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-08 03:53:58,321 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-08 03:53:58,323 INFO L225 Difference]: With dead ends: 36 [2022-04-08 03:53:58,324 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 03:53:58,324 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-08 03:53:58,325 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:53:58,326 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.2s Time] [2022-04-08 03:53:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 03:53:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 03:53:58,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:58,343 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-08 03:53:58,344 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-08 03:53:58,344 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-08 03:53:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:58,347 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 03:53:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 03:53:58,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:58,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:58,348 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-08 03:53:58,349 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-08 03:53:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:58,352 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 03:53:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 03:53:58,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:58,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:58,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:58,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:58,353 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-08 03:53:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-08 03:53:58,356 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2022-04-08 03:53:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:58,356 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-08 03:53:58,356 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-08 03:53:58,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 41 transitions. [2022-04-08 03:53:58,405 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-08 03:53:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 03:53:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 03:53:58,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:58,407 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-08 03:53:58,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:53:58,407 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 1 times [2022-04-08 03:53:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:58,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [21841906] [2022-04-08 03:53:58,409 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 2 times [2022-04-08 03:53:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:58,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80129434] [2022-04-08 03:53:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:58,504 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-08 03:53:58,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-08 03:53:58,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #102#return; {518#true} is VALID [2022-04-08 03:53:58,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 03:53:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:58,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {518#true} ~cond := #in~cond; {518#true} is VALID [2022-04-08 03:53:58,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} assume !(0 == ~cond); {518#true} is VALID [2022-04-08 03:53:58,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-08 03:53:58,513 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-08 03:53:58,514 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-08 03:53:58,514 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-08 03:53:58,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-08 03:53:58,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #102#return; {518#true} is VALID [2022-04-08 03:53:58,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret8 := main(); {518#true} is VALID [2022-04-08 03:53:58,515 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-08 03:53:58,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {518#true} assume ~bufferlen~0 > 1; {523#(<= 2 main_~bufferlen~0)} is VALID [2022-04-08 03:53:58,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {523#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {523#(<= 2 main_~bufferlen~0)} is VALID [2022-04-08 03:53:58,517 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-08 03:53:58,517 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-08 03:53:58,518 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-08 03:53:58,518 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-08 03:53:58,518 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-08 03:53:58,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {518#true} ~cond := #in~cond; {518#true} is VALID [2022-04-08 03:53:58,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#true} assume !(0 == ~cond); {518#true} is VALID [2022-04-08 03:53:58,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-08 03:53:58,520 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-08 03:53:58,520 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-08 03:53:58,521 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-08 03:53:58,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {530#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {519#false} is VALID [2022-04-08 03:53:58,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-04-08 03:53:58,522 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-08 03:53:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80129434] [2022-04-08 03:53:58,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80129434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:58,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:58,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:58,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:58,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [21841906] [2022-04-08 03:53:58,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [21841906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:58,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:58,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368467348] [2022-04-08 03:53:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:58,524 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-08 03:53:58,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:58,525 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-08 03:53:58,540 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-08 03:53:58,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:58,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:58,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:58,542 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-08 03:53:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:59,120 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-08 03:53:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:53:59,120 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-08 03:53:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:53:59,121 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-08 03:53:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 03:53:59,124 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-08 03:53:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 03:53:59,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-08 03:53:59,182 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-08 03:53:59,184 INFO L225 Difference]: With dead ends: 49 [2022-04-08 03:53:59,185 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 03:53:59,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:53:59,186 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-08 03:53:59,186 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-08 03:53:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 03:53:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-04-08 03:53:59,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:53:59,229 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-08 03:53:59,230 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-08 03:53:59,230 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-08 03:53:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:59,233 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-08 03:53:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-08 03:53:59,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:59,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:59,235 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-08 03:53:59,235 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-08 03:53:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:53:59,238 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-08 03:53:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-08 03:53:59,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:53:59,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:53:59,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:53:59,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:53:59,240 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-08 03:53:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-08 03:53:59,243 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2022-04-08 03:53:59,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:53:59,244 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-08 03:53:59,244 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-08 03:53:59,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 57 transitions. [2022-04-08 03:53:59,302 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-08 03:53:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-08 03:53:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 03:53:59,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:53:59,304 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-08 03:53:59,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 03:53:59,306 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:53:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:53:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 1 times [2022-04-08 03:53:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:59,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [453267838] [2022-04-08 03:53:59,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:53:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 2 times [2022-04-08 03:53:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:53:59,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330899273] [2022-04-08 03:53:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:53:59,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:53:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:53:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:59,401 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-08 03:53:59,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 03:53:59,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {826#true} {826#true} #102#return; {826#true} is VALID [2022-04-08 03:53:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 03:53:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:59,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-08 03:53:59,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-08 03:53:59,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 03:53:59,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {831#(= main_~in~0 0)} #86#return; {831#(= main_~in~0 0)} is VALID [2022-04-08 03:53:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 03:53:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:53:59,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-08 03:53:59,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-08 03:53:59,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 03:53:59,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {831#(= main_~in~0 0)} #88#return; {831#(= main_~in~0 0)} is VALID [2022-04-08 03:53:59,425 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-08 03:53:59,425 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-08 03:53:59,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 03:53:59,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {826#true} #102#return; {826#true} is VALID [2022-04-08 03:53:59,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {826#true} call #t~ret8 := main(); {826#true} is VALID [2022-04-08 03:53:59,426 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-08 03:53:59,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#true} assume ~bufferlen~0 > 1; {826#true} is VALID [2022-04-08 03:53:59,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#true} assume ~inlen~0 > 0; {826#true} is VALID [2022-04-08 03:53:59,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#true} assume ~bufferlen~0 < ~inlen~0; {826#true} is VALID [2022-04-08 03:53:59,427 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-08 03:53:59,428 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-08 03:53:59,428 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-08 03:53:59,428 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-08 03:53:59,429 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-08 03:53:59,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-08 03:53:59,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-08 03:53:59,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 03:53:59,430 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {826#true} {831#(= main_~in~0 0)} #86#return; {831#(= main_~in~0 0)} is VALID [2022-04-08 03:53:59,430 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-08 03:53:59,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-08 03:53:59,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-08 03:53:59,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 03:53:59,431 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {826#true} {831#(= main_~in~0 0)} #88#return; {831#(= main_~in~0 0)} is VALID [2022-04-08 03:53:59,432 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-08 03:53:59,432 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-08 03:53:59,433 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-08 03:53:59,433 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-08 03:53:59,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {842#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {827#false} is VALID [2022-04-08 03:53:59,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {827#false} assume !false; {827#false} is VALID [2022-04-08 03:53:59,434 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-08 03:53:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:53:59,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330899273] [2022-04-08 03:53:59,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330899273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:59,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:59,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:59,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:53:59,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [453267838] [2022-04-08 03:53:59,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [453267838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:53:59,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:53:59,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:53:59,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674474661] [2022-04-08 03:53:59,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:53:59,439 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-08 03:53:59,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:53:59,440 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-08 03:53:59,458 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-08 03:53:59,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:53:59,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:53:59,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:53:59,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:53:59,460 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-08 03:54:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:00,066 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-08 03:54:00,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:54:00,066 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-08 03:54:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:00,067 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-08 03:54:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 03:54:00,069 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-08 03:54:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-08 03:54:00,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-08 03:54:00,148 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-08 03:54:00,150 INFO L225 Difference]: With dead ends: 56 [2022-04-08 03:54:00,150 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 03:54:00,150 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-08 03:54:00,151 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-08 03:54:00,151 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-08 03:54:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 03:54:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-04-08 03:54:00,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:00,191 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-08 03:54:00,192 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-08 03:54:00,192 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-08 03:54:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:00,195 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-08 03:54:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-08 03:54:00,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:00,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:00,197 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-08 03:54:00,197 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-08 03:54:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:00,200 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-08 03:54:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-08 03:54:00,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:00,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:00,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:00,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:00,202 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-08 03:54:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-04-08 03:54:00,204 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2022-04-08 03:54:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:00,204 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-04-08 03:54:00,205 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-08 03:54:00,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 60 transitions. [2022-04-08 03:54:00,265 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-08 03:54:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-08 03:54:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 03:54:00,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:00,266 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-08 03:54:00,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 03:54:00,267 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:00,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 1 times [2022-04-08 03:54:00,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:00,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [380217103] [2022-04-08 03:54:00,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 2 times [2022-04-08 03:54:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:00,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110894437] [2022-04-08 03:54:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:00,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,363 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-08 03:54:00,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-08 03:54:00,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #102#return; {1174#true} is VALID [2022-04-08 03:54:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 03:54:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-08 03:54:00,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-08 03:54:00,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-08 03:54:00,370 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-08 03:54:00,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 03:54:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-08 03:54:00,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-08 03:54:00,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-08 03:54:00,378 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-08 03:54:00,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-08 03:54:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:00,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-08 03:54:00,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-08 03:54:00,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-08 03:54:00,391 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-08 03:54:00,392 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-08 03:54:00,392 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-08 03:54:00,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-08 03:54:00,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #102#return; {1174#true} is VALID [2022-04-08 03:54:00,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret8 := main(); {1174#true} is VALID [2022-04-08 03:54:00,393 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-08 03:54:00,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#true} assume ~bufferlen~0 > 1; {1179#(<= 2 main_~bufferlen~0)} is VALID [2022-04-08 03:54:00,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1179#(<= 2 main_~bufferlen~0)} is VALID [2022-04-08 03:54:00,394 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-08 03:54:00,395 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-08 03:54:00,395 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-08 03:54:00,396 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-08 03:54:00,396 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-08 03:54:00,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-08 03:54:00,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-08 03:54:00,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-08 03:54:00,397 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-08 03:54:00,397 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-08 03:54:00,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-08 03:54:00,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-08 03:54:00,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-08 03:54:00,398 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-08 03:54:00,399 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-08 03:54:00,399 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-08 03:54:00,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {1174#true} ~cond := #in~cond; {1174#true} is VALID [2022-04-08 03:54:00,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {1174#true} assume !(0 == ~cond); {1174#true} is VALID [2022-04-08 03:54:00,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-08 03:54:00,400 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-08 03:54:00,401 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-08 03:54:00,401 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-08 03:54:00,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {1195#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1175#false} is VALID [2022-04-08 03:54:00,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-08 03:54:00,402 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-08 03:54:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:00,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110894437] [2022-04-08 03:54:00,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110894437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:00,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:00,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:54:00,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:00,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [380217103] [2022-04-08 03:54:00,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [380217103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:00,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:00,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:54:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282938419] [2022-04-08 03:54:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:00,404 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-08 03:54:00,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:00,405 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-08 03:54:00,422 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-08 03:54:00,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:54:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:54:00,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:54:00,424 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-08 03:54:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:01,233 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-08 03:54:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:54:01,234 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-08 03:54:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:01,234 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-08 03:54:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-08 03:54:01,237 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-08 03:54:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-04-08 03:54:01,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2022-04-08 03:54:01,324 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-08 03:54:01,328 INFO L225 Difference]: With dead ends: 75 [2022-04-08 03:54:01,328 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 03:54:01,328 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-08 03:54:01,329 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-08 03:54:01,329 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-08 03:54:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 03:54:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-04-08 03:54:01,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:01,394 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-08 03:54:01,395 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-08 03:54:01,396 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-08 03:54:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:01,400 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-08 03:54:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-08 03:54:01,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:01,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:01,403 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-08 03:54:01,404 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-08 03:54:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:01,408 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-08 03:54:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-04-08 03:54:01,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:01,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:01,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:01,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:01,410 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-08 03:54:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-08 03:54:01,414 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2022-04-08 03:54:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:01,414 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-08 03:54:01,415 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-08 03:54:01,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-08 03:54:01,497 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-08 03:54:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 03:54:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 03:54:01,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:01,498 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-08 03:54:01,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 03:54:01,498 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 1 times [2022-04-08 03:54:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:01,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2001850785] [2022-04-08 03:54:01,500 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:54:01,500 INFO L85 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 2 times [2022-04-08 03:54:01,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:54:01,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207361577] [2022-04-08 03:54:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:54:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:54:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:54:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:01,610 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-08 03:54:01,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-08 03:54:01,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1630#true} {1630#true} #102#return; {1630#true} is VALID [2022-04-08 03:54:01,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 03:54:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:01,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-08 03:54:01,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-08 03:54:01,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-08 03:54:01,619 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-08 03:54:01,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 03:54:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:01,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-08 03:54:01,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-08 03:54:01,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-08 03:54:01,630 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-08 03:54:01,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 03:54:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:54:01,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-08 03:54:01,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-08 03:54:01,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-08 03:54:01,640 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-08 03:54:01,641 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-08 03:54:01,641 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-08 03:54:01,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-08 03:54:01,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#true} {1630#true} #102#return; {1630#true} is VALID [2022-04-08 03:54:01,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#true} call #t~ret8 := main(); {1630#true} is VALID [2022-04-08 03:54:01,655 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-08 03:54:01,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {1630#true} assume ~bufferlen~0 > 1; {1635#(<= 2 main_~bufferlen~0)} is VALID [2022-04-08 03:54:01,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {1635#(<= 2 main_~bufferlen~0)} assume ~inlen~0 > 0; {1635#(<= 2 main_~bufferlen~0)} is VALID [2022-04-08 03:54:01,656 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-08 03:54:01,657 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-08 03:54:01,657 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-08 03:54:01,658 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-08 03:54:01,660 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-08 03:54:01,660 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-08 03:54:01,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-08 03:54:01,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-08 03:54:01,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-08 03:54:01,663 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-08 03:54:01,663 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-08 03:54:01,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-08 03:54:01,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-08 03:54:01,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-08 03:54:01,668 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-08 03:54:01,669 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-08 03:54:01,669 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-08 03:54:01,669 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-08 03:54:01,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {1630#true} ~cond := #in~cond; {1630#true} is VALID [2022-04-08 03:54:01,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {1630#true} assume !(0 == ~cond); {1630#true} is VALID [2022-04-08 03:54:01,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {1630#true} assume true; {1630#true} is VALID [2022-04-08 03:54:01,670 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-08 03:54:01,671 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-08 03:54:01,671 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-08 03:54:01,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {1652#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1631#false} is VALID [2022-04-08 03:54:01,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#false} assume !false; {1631#false} is VALID [2022-04-08 03:54:01,672 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-08 03:54:01,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:54:01,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207361577] [2022-04-08 03:54:01,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207361577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:01,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:01,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:54:01,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:54:01,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2001850785] [2022-04-08 03:54:01,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2001850785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:54:01,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:54:01,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:54:01,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189516044] [2022-04-08 03:54:01,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:54:01,674 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-08 03:54:01,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:54:01,674 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-08 03:54:01,694 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-08 03:54:01,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:54:01,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:54:01,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:54:01,695 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-08 03:54:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:02,530 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-08 03:54:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:54:02,530 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-08 03:54:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:54:02,530 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-08 03:54:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-08 03:54:02,533 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-08 03:54:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2022-04-08 03:54:02,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2022-04-08 03:54:02,604 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-08 03:54:02,606 INFO L225 Difference]: With dead ends: 77 [2022-04-08 03:54:02,606 INFO L226 Difference]: Without dead ends: 75 [2022-04-08 03:54:02,607 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-08 03:54:02,608 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-08 03:54:02,608 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-08 03:54:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-08 03:54:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-08 03:54:02,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:54:02,716 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-08 03:54:02,717 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-08 03:54:02,717 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-08 03:54:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:02,720 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-08 03:54:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2022-04-08 03:54:02,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:02,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:02,721 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-08 03:54:02,722 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-08 03:54:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:54:02,725 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-08 03:54:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2022-04-08 03:54:02,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:54:02,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:54:02,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:54:02,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:54:02,726 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-08 03:54:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-04-08 03:54:02,729 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-04-08 03:54:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:54:02,729 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-04-08 03:54:02,729 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-08 03:54:02,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 82 transitions. [2022-04-08 03:54:02,826 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-08 03:54:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-08 03:54:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 03:54:02,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:54:02,828 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-08 03:54:02,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 03:54:02,828 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:54:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:54:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 1 times [2022-04-08 03:54:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:54:02,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048879844] [2022-04-08 03:54:03,905 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-08 03:54:03,906 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:190) 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:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 03:54:03,914 INFO L158 Benchmark]: Toolchain (without parser) took 7842.15ms. Allocated memory was 175.1MB in the beginning and 216.0MB in the end (delta: 40.9MB). Free memory was 128.8MB in the beginning and 148.4MB in the end (delta: -19.6MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. [2022-04-08 03:54:03,914 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:54:03,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.33ms. Allocated memory is still 175.1MB. Free memory was 128.6MB in the beginning and 153.0MB in the end (delta: -24.5MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-08 03:54:03,915 INFO L158 Benchmark]: Boogie Preprocessor took 35.77ms. Allocated memory is still 175.1MB. Free memory was 153.0MB in the beginning and 151.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:54:03,916 INFO L158 Benchmark]: RCFGBuilder took 396.00ms. Allocated memory is still 175.1MB. Free memory was 151.8MB in the beginning and 138.8MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 03:54:03,916 INFO L158 Benchmark]: TraceAbstraction took 7161.25ms. Allocated memory was 175.1MB in the beginning and 216.0MB in the end (delta: 40.9MB). Free memory was 138.1MB in the beginning and 148.4MB in the end (delta: -10.2MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. [2022-04-08 03:54:03,917 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.13ms. Allocated memory is still 175.1MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.33ms. Allocated memory is still 175.1MB. Free memory was 128.6MB in the beginning and 153.0MB in the end (delta: -24.5MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.77ms. Allocated memory is still 175.1MB. Free memory was 153.0MB in the beginning and 151.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 396.00ms. Allocated memory is still 175.1MB. Free memory was 151.8MB in the beginning and 138.8MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7161.25ms. Allocated memory was 175.1MB in the beginning and 216.0MB in the end (delta: 40.9MB). Free memory was 138.1MB in the beginning and 148.4MB in the end (delta: -10.2MB). Peak memory consumption was 107.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-08 03:54:03,936 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...