/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 16:09:12,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:09:12,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:09:13,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:09:13,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:09:13,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:09:13,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:09:13,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:09:13,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:09:13,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:09:13,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:09:13,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:09:13,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:09:13,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:09:13,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:09:13,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:09:13,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:09:13,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:09:13,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:09:13,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:09:13,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:09:13,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:09:13,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:09:13,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:09:13,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:09:13,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:09:13,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:09:13,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:09:13,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:09:13,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:09:13,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:09:13,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:09:13,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:09:13,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:09:13,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:09:13,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:09:13,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:09:13,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:09:13,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:09:13,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:09:13,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:09:13,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 16:09:13,075 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:09:13,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:09:13,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:09:13,078 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:09:13,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:09:13,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:09:13,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:09:13,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:09:13,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:09:13,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:09:13,080 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:09:13,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:09:13,081 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:09:13,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:09:13,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:09:13,082 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:09:13,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:09:13,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:09:13,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:09:13,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:09:13,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:09:13,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:09:13,083 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:09:13,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:09:13,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:09:13,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:09:13,411 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:09:13,412 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:09:13,413 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2020-07-08 16:09:13,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baab2d2dd/ac4b565e03c944a1bbe63394587615b8/FLAG3a3834fe0 [2020-07-08 16:09:14,029 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:09:14,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2020-07-08 16:09:14,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baab2d2dd/ac4b565e03c944a1bbe63394587615b8/FLAG3a3834fe0 [2020-07-08 16:09:14,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baab2d2dd/ac4b565e03c944a1bbe63394587615b8 [2020-07-08 16:09:14,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:09:14,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:09:14,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:09:14,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:09:14,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:09:14,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47941ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14, skipping insertion in model container [2020-07-08 16:09:14,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:09:14,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:09:14,616 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-08 16:09:14,619 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-08 16:09:14,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:09:14,666 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:09:14,791 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-08 16:09:14,793 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-08 16:09:14,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:09:14,835 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:09:14,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14 WrapperNode [2020-07-08 16:09:14,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:09:14,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:09:14,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:09:14,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:09:14,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (1/1) ... [2020-07-08 16:09:14,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:09:14,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:09:14,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:09:14,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:09:14,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:09:14,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:09:14,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:09:14,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 16:09:14,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 16:09:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-08 16:09:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-08 16:09:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-08 16:09:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-08 16:09:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-08 16:09:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-08 16:09:14,978 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:09:14,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-08 16:09:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 16:09:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 16:09:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 16:09:14,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 16:09:14,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-08 16:09:14,980 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 16:09:14,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 16:09:14,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:09:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 16:09:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-08 16:09:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 16:09:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 16:09:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 16:09:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-08 16:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 16:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-08 16:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 16:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 16:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-08 16:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-08 16:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-08 16:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 16:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-08 16:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:09:15,945 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:09:15,946 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 16:09:15,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:09:15 BoogieIcfgContainer [2020-07-08 16:09:15,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:09:15,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:09:15,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:09:15,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:09:15,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:09:14" (1/3) ... [2020-07-08 16:09:15,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f9a37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:09:15, skipping insertion in model container [2020-07-08 16:09:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:09:14" (2/3) ... [2020-07-08 16:09:15,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f9a37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:09:15, skipping insertion in model container [2020-07-08 16:09:15,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:09:15" (3/3) ... [2020-07-08 16:09:15,971 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2020-07-08 16:09:15,982 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:09:15,989 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 16:09:16,003 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 16:09:16,028 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:09:16,028 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:09:16,028 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:09:16,028 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:09:16,029 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:09:16,029 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:09:16,029 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:09:16,029 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:09:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2020-07-08 16:09:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-08 16:09:16,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:09:16,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:09:16,072 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:09:16,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:09:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1242734485, now seen corresponding path program 1 times [2020-07-08 16:09:16,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:09:16,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023167098] [2020-07-08 16:09:16,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:09:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:16,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {186#true} is VALID [2020-07-08 16:09:16,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} #valid := #valid[0 := 0]; {186#true} is VALID [2020-07-08 16:09:16,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} assume 0 < #StackHeapBarrier; {186#true} is VALID [2020-07-08 16:09:16,474 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,475 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #255#return; {186#true} is VALID [2020-07-08 16:09:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:16,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {186#true} is VALID [2020-07-08 16:09:16,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} havoc #t~nondet1; {186#true} is VALID [2020-07-08 16:09:16,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} #res.base, #res.offset := 0, 0; {186#true} is VALID [2020-07-08 16:09:16,531 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,532 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #211#return; {186#true} is VALID [2020-07-08 16:09:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:16,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {186#true} is VALID [2020-07-08 16:09:16,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} assume ~n.base == 0 && ~n.offset == 0; {186#true} is VALID [2020-07-08 16:09:16,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} #res := 2147483647; {186#true} is VALID [2020-07-08 16:09:16,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,548 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #225#return; {186#true} is VALID [2020-07-08 16:09:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:16,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {186#true} is VALID [2020-07-08 16:09:16,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} assume ~t.base == 0 && ~t.offset == 0; {186#true} is VALID [2020-07-08 16:09:16,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} #res := 0; {226#(= 0 |size_#res|)} is VALID [2020-07-08 16:09:16,581 INFO L280 TraceCheckUtils]: 3: Hoare triple {226#(= 0 |size_#res|)} assume true; {226#(= 0 |size_#res|)} is VALID [2020-07-08 16:09:16,583 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {226#(= 0 |size_#res|)} {186#true} #227#return; {208#(= 0 |task_#t~ret26|)} is VALID [2020-07-08 16:09:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:16,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#true} ~cond := #in~cond; {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-08 16:09:16,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {228#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-08 16:09:16,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {228#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {228#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-08 16:09:16,625 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {228#(not (= 0 |assume_abort_if_not_#in~cond|))} {209#(= 0 task_~n~1)} #229#return; {187#false} is VALID [2020-07-08 16:09:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:16,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {229#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {186#true} is VALID [2020-07-08 16:09:16,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {186#true} {187#false} #231#return; {187#false} is VALID [2020-07-08 16:09:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:16,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {186#true} is VALID [2020-07-08 16:09:16,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {186#true} is VALID [2020-07-08 16:09:16,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} ~i := #in~i; {186#true} is VALID [2020-07-08 16:09:16,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume ~t.base == 0 && ~t.offset == 0; {186#true} is VALID [2020-07-08 16:09:16,681 INFO L280 TraceCheckUtils]: 4: Hoare triple {186#true} #res := ~i; {186#true} is VALID [2020-07-08 16:09:16,681 INFO L280 TraceCheckUtils]: 5: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,682 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {186#true} {187#false} #233#return; {187#false} is VALID [2020-07-08 16:09:16,683 INFO L263 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {224#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:09:16,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {186#true} is VALID [2020-07-08 16:09:16,684 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} #valid := #valid[0 := 0]; {186#true} is VALID [2020-07-08 16:09:16,684 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#true} assume 0 < #StackHeapBarrier; {186#true} is VALID [2020-07-08 16:09:16,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,685 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {186#true} {186#true} #255#return; {186#true} is VALID [2020-07-08 16:09:16,685 INFO L263 TraceCheckUtils]: 6: Hoare triple {186#true} call #t~ret39 := main(); {186#true} is VALID [2020-07-08 16:09:16,687 INFO L263 TraceCheckUtils]: 7: Hoare triple {186#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {225#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 16:09:16,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {225#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {186#true} is VALID [2020-07-08 16:09:16,688 INFO L280 TraceCheckUtils]: 9: Hoare triple {186#true} havoc #t~nondet1; {186#true} is VALID [2020-07-08 16:09:16,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {186#true} #res.base, #res.offset := 0, 0; {186#true} is VALID [2020-07-08 16:09:16,689 INFO L280 TraceCheckUtils]: 11: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,689 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {186#true} {186#true} #211#return; {186#true} is VALID [2020-07-08 16:09:16,689 INFO L263 TraceCheckUtils]: 13: Hoare triple {186#true} call task(#t~ret38.base, #t~ret38.offset); {186#true} is VALID [2020-07-08 16:09:16,690 INFO L280 TraceCheckUtils]: 14: Hoare triple {186#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {186#true} is VALID [2020-07-08 16:09:16,690 INFO L263 TraceCheckUtils]: 15: Hoare triple {186#true} call #t~ret25 := min(~t.base, ~t.offset); {186#true} is VALID [2020-07-08 16:09:16,690 INFO L280 TraceCheckUtils]: 16: Hoare triple {186#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {186#true} is VALID [2020-07-08 16:09:16,691 INFO L280 TraceCheckUtils]: 17: Hoare triple {186#true} assume ~n.base == 0 && ~n.offset == 0; {186#true} is VALID [2020-07-08 16:09:16,691 INFO L280 TraceCheckUtils]: 18: Hoare triple {186#true} #res := 2147483647; {186#true} is VALID [2020-07-08 16:09:16,691 INFO L280 TraceCheckUtils]: 19: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,692 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {186#true} {186#true} #225#return; {186#true} is VALID [2020-07-08 16:09:16,692 INFO L280 TraceCheckUtils]: 21: Hoare triple {186#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {186#true} is VALID [2020-07-08 16:09:16,692 INFO L280 TraceCheckUtils]: 22: Hoare triple {186#true} ~a~1 := #t~ret25; {186#true} is VALID [2020-07-08 16:09:16,693 INFO L280 TraceCheckUtils]: 23: Hoare triple {186#true} havoc #t~ret25; {186#true} is VALID [2020-07-08 16:09:16,693 INFO L280 TraceCheckUtils]: 24: Hoare triple {186#true} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L75 {186#true} is VALID [2020-07-08 16:09:16,694 INFO L263 TraceCheckUtils]: 25: Hoare triple {186#true} call #t~ret26 := size(~t.base, ~t.offset); {186#true} is VALID [2020-07-08 16:09:16,694 INFO L280 TraceCheckUtils]: 26: Hoare triple {186#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {186#true} is VALID [2020-07-08 16:09:16,694 INFO L280 TraceCheckUtils]: 27: Hoare triple {186#true} assume ~t.base == 0 && ~t.offset == 0; {186#true} is VALID [2020-07-08 16:09:16,696 INFO L280 TraceCheckUtils]: 28: Hoare triple {186#true} #res := 0; {226#(= 0 |size_#res|)} is VALID [2020-07-08 16:09:16,696 INFO L280 TraceCheckUtils]: 29: Hoare triple {226#(= 0 |size_#res|)} assume true; {226#(= 0 |size_#res|)} is VALID [2020-07-08 16:09:16,698 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {226#(= 0 |size_#res|)} {186#true} #227#return; {208#(= 0 |task_#t~ret26|)} is VALID [2020-07-08 16:09:16,699 INFO L280 TraceCheckUtils]: 31: Hoare triple {208#(= 0 |task_#t~ret26|)} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647; {208#(= 0 |task_#t~ret26|)} is VALID [2020-07-08 16:09:16,700 INFO L280 TraceCheckUtils]: 32: Hoare triple {208#(= 0 |task_#t~ret26|)} ~n~1 := #t~ret26; {209#(= 0 task_~n~1)} is VALID [2020-07-08 16:09:16,701 INFO L280 TraceCheckUtils]: 33: Hoare triple {209#(= 0 task_~n~1)} havoc #t~ret26; {209#(= 0 task_~n~1)} is VALID [2020-07-08 16:09:16,701 INFO L263 TraceCheckUtils]: 34: Hoare triple {209#(= 0 task_~n~1)} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {186#true} is VALID [2020-07-08 16:09:16,702 INFO L280 TraceCheckUtils]: 35: Hoare triple {186#true} ~cond := #in~cond; {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-08 16:09:16,703 INFO L280 TraceCheckUtils]: 36: Hoare triple {227#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {228#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-08 16:09:16,704 INFO L280 TraceCheckUtils]: 37: Hoare triple {228#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {228#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-08 16:09:16,705 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {228#(not (= 0 |assume_abort_if_not_#in~cond|))} {209#(= 0 task_~n~1)} #229#return; {187#false} is VALID [2020-07-08 16:09:16,706 INFO L280 TraceCheckUtils]: 39: Hoare triple {187#false} SUMMARY for call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L78-1 {187#false} is VALID [2020-07-08 16:09:16,706 INFO L263 TraceCheckUtils]: 40: Hoare triple {187#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {229#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 16:09:16,707 INFO L280 TraceCheckUtils]: 41: Hoare triple {229#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {186#true} is VALID [2020-07-08 16:09:16,707 INFO L280 TraceCheckUtils]: 42: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,708 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {186#true} {187#false} #231#return; {187#false} is VALID [2020-07-08 16:09:16,708 INFO L280 TraceCheckUtils]: 44: Hoare triple {187#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {187#false} is VALID [2020-07-08 16:09:16,708 INFO L263 TraceCheckUtils]: 45: Hoare triple {187#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {230#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 16:09:16,709 INFO L280 TraceCheckUtils]: 46: Hoare triple {230#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {186#true} is VALID [2020-07-08 16:09:16,709 INFO L280 TraceCheckUtils]: 47: Hoare triple {186#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {186#true} is VALID [2020-07-08 16:09:16,709 INFO L280 TraceCheckUtils]: 48: Hoare triple {186#true} ~i := #in~i; {186#true} is VALID [2020-07-08 16:09:16,710 INFO L280 TraceCheckUtils]: 49: Hoare triple {186#true} assume ~t.base == 0 && ~t.offset == 0; {186#true} is VALID [2020-07-08 16:09:16,710 INFO L280 TraceCheckUtils]: 50: Hoare triple {186#true} #res := ~i; {186#true} is VALID [2020-07-08 16:09:16,710 INFO L280 TraceCheckUtils]: 51: Hoare triple {186#true} assume true; {186#true} is VALID [2020-07-08 16:09:16,711 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {186#true} {187#false} #233#return; {187#false} is VALID [2020-07-08 16:09:16,711 INFO L280 TraceCheckUtils]: 53: Hoare triple {187#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {187#false} is VALID [2020-07-08 16:09:16,711 INFO L280 TraceCheckUtils]: 54: Hoare triple {187#false} havoc #t~ret28; {187#false} is VALID [2020-07-08 16:09:16,712 INFO L280 TraceCheckUtils]: 55: Hoare triple {187#false} SUMMARY for call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L81 {187#false} is VALID [2020-07-08 16:09:16,712 INFO L263 TraceCheckUtils]: 56: Hoare triple {187#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {187#false} is VALID [2020-07-08 16:09:16,713 INFO L280 TraceCheckUtils]: 57: Hoare triple {187#false} ~cond := #in~cond; {187#false} is VALID [2020-07-08 16:09:16,713 INFO L280 TraceCheckUtils]: 58: Hoare triple {187#false} assume 0 == ~cond; {187#false} is VALID [2020-07-08 16:09:16,714 INFO L280 TraceCheckUtils]: 59: Hoare triple {187#false} assume !false; {187#false} is VALID [2020-07-08 16:09:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 16:09:16,728 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:09:16,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023167098] [2020-07-08 16:09:16,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:09:16,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 16:09:16,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885390026] [2020-07-08 16:09:16,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-08 16:09:16,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:09:16,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 16:09:16,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:09:16,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 16:09:16,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:09:16,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 16:09:16,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-08 16:09:16,875 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 11 states. [2020-07-08 16:09:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:21,280 INFO L93 Difference]: Finished difference Result 324 states and 379 transitions. [2020-07-08 16:09:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 16:09:21,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-08 16:09:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:09:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 16:09:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 379 transitions. [2020-07-08 16:09:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 16:09:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 379 transitions. [2020-07-08 16:09:21,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 379 transitions. [2020-07-08 16:09:21,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:09:21,898 INFO L225 Difference]: With dead ends: 324 [2020-07-08 16:09:21,898 INFO L226 Difference]: Without dead ends: 188 [2020-07-08 16:09:21,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2020-07-08 16:09:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-07-08 16:09:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2020-07-08 16:09:22,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:09:22,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 175 states. [2020-07-08 16:09:22,291 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 175 states. [2020-07-08 16:09:22,292 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 175 states. [2020-07-08 16:09:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:22,317 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2020-07-08 16:09:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2020-07-08 16:09:22,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:09:22,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:09:22,323 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 188 states. [2020-07-08 16:09:22,323 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 188 states. [2020-07-08 16:09:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:22,344 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2020-07-08 16:09:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2020-07-08 16:09:22,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:09:22,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:09:22,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:09:22,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:09:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-07-08 16:09:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2020-07-08 16:09:22,367 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 60 [2020-07-08 16:09:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:09:22,368 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2020-07-08 16:09:22,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 16:09:22,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 175 states and 198 transitions. [2020-07-08 16:09:22,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:09:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2020-07-08 16:09:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-08 16:09:22,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:09:22,678 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:09:22,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:09:22,678 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:09:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:09:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1686429873, now seen corresponding path program 1 times [2020-07-08 16:09:22,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:09:22,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1944970520] [2020-07-08 16:09:22,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:09:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:22,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {1681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1622#true} is VALID [2020-07-08 16:09:22,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-08 16:09:22,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-08 16:09:22,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:22,843 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1622#true} #255#return; {1622#true} is VALID [2020-07-08 16:09:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:22,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {1682#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {1622#true} is VALID [2020-07-08 16:09:22,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} havoc #t~nondet1; {1622#true} is VALID [2020-07-08 16:09:22,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #res.base, #res.offset := 0, 0; {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 16:09:22,944 INFO L280 TraceCheckUtils]: 3: Hoare triple {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 16:09:22,946 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1622#true} #211#return; {1634#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID [2020-07-08 16:09:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:22,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1622#true} is VALID [2020-07-08 16:09:22,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume ~n.base == 0 && ~n.offset == 0; {1622#true} is VALID [2020-07-08 16:09:22,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #res := 2147483647; {1622#true} is VALID [2020-07-08 16:09:22,957 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:22,958 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #225#return; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 16:09:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:23,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-08 16:09:23,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-08 16:09:23,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,040 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #251#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:23,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-08 16:09:23,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-08 16:09:23,048 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,049 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #253#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1684#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-08 16:09:23,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {1684#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0); {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L70 {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,052 INFO L263 TraceCheckUtils]: 3: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1622#true} is VALID [2020-07-08 16:09:23,053 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-08 16:09:23,053 INFO L280 TraceCheckUtils]: 5: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,053 INFO L280 TraceCheckUtils]: 6: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-08 16:09:23,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,055 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #251#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L70-3 {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,056 INFO L263 TraceCheckUtils]: 11: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1622#true} is VALID [2020-07-08 16:09:23,057 INFO L280 TraceCheckUtils]: 12: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-08 16:09:23,057 INFO L280 TraceCheckUtils]: 13: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,057 INFO L280 TraceCheckUtils]: 14: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-08 16:09:23,058 INFO L280 TraceCheckUtils]: 15: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,072 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #253#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,073 INFO L280 TraceCheckUtils]: 17: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,073 INFO L280 TraceCheckUtils]: 18: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #res := 1 + (#t~ret22 + #t~ret24); {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,074 INFO L280 TraceCheckUtils]: 19: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret22; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,074 INFO L280 TraceCheckUtils]: 20: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret24; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,075 INFO L280 TraceCheckUtils]: 21: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem23.base, #t~mem23.offset; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,075 INFO L280 TraceCheckUtils]: 22: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem21.base, #t~mem21.offset; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,075 INFO L280 TraceCheckUtils]: 23: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,076 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #227#return; {1623#false} is VALID [2020-07-08 16:09:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:23,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2020-07-08 16:09:23,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2020-07-08 16:09:23,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,084 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1623#false} #229#return; {1623#false} is VALID [2020-07-08 16:09:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:23,104 INFO L280 TraceCheckUtils]: 0: Hoare triple {1696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1622#true} is VALID [2020-07-08 16:09:23,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,105 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1622#true} {1623#false} #231#return; {1623#false} is VALID [2020-07-08 16:09:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:09:23,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {1697#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-08 16:09:23,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1622#true} is VALID [2020-07-08 16:09:23,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} ~i := #in~i; {1622#true} is VALID [2020-07-08 16:09:23,133 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} #res := ~i; {1622#true} is VALID [2020-07-08 16:09:23,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,133 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1622#true} {1623#false} #233#return; {1623#false} is VALID [2020-07-08 16:09:23,136 INFO L263 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:09:23,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {1681#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1622#true} is VALID [2020-07-08 16:09:23,137 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-08 16:09:23,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-08 16:09:23,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,137 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1622#true} {1622#true} #255#return; {1622#true} is VALID [2020-07-08 16:09:23,138 INFO L263 TraceCheckUtils]: 6: Hoare triple {1622#true} call #t~ret39 := main(); {1622#true} is VALID [2020-07-08 16:09:23,139 INFO L263 TraceCheckUtils]: 7: Hoare triple {1622#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {1682#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 16:09:23,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {1682#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {1622#true} is VALID [2020-07-08 16:09:23,140 INFO L280 TraceCheckUtils]: 9: Hoare triple {1622#true} havoc #t~nondet1; {1622#true} is VALID [2020-07-08 16:09:23,141 INFO L280 TraceCheckUtils]: 10: Hoare triple {1622#true} #res.base, #res.offset := 0, 0; {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 16:09:23,142 INFO L280 TraceCheckUtils]: 11: Hoare triple {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-08 16:09:23,143 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1683#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1622#true} #211#return; {1634#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID [2020-07-08 16:09:23,144 INFO L263 TraceCheckUtils]: 13: Hoare triple {1634#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} call task(#t~ret38.base, #t~ret38.offset); {1635#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-08 16:09:23,145 INFO L280 TraceCheckUtils]: 14: Hoare triple {1635#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 16:09:23,146 INFO L263 TraceCheckUtils]: 15: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret25 := min(~t.base, ~t.offset); {1622#true} is VALID [2020-07-08 16:09:23,146 INFO L280 TraceCheckUtils]: 16: Hoare triple {1622#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1622#true} is VALID [2020-07-08 16:09:23,146 INFO L280 TraceCheckUtils]: 17: Hoare triple {1622#true} assume ~n.base == 0 && ~n.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,147 INFO L280 TraceCheckUtils]: 18: Hoare triple {1622#true} #res := 2147483647; {1622#true} is VALID [2020-07-08 16:09:23,147 INFO L280 TraceCheckUtils]: 19: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,153 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1622#true} {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #225#return; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 16:09:23,154 INFO L280 TraceCheckUtils]: 21: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 16:09:23,155 INFO L280 TraceCheckUtils]: 22: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} ~a~1 := #t~ret25; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 16:09:23,156 INFO L280 TraceCheckUtils]: 23: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} havoc #t~ret25; {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 16:09:23,156 INFO L280 TraceCheckUtils]: 24: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L75 {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-08 16:09:23,156 INFO L263 TraceCheckUtils]: 25: Hoare triple {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret26 := size(~t.base, ~t.offset); {1622#true} is VALID [2020-07-08 16:09:23,158 INFO L280 TraceCheckUtils]: 26: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1684#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-08 16:09:23,159 INFO L280 TraceCheckUtils]: 27: Hoare triple {1684#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0); {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,159 INFO L280 TraceCheckUtils]: 28: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L70 {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,159 INFO L263 TraceCheckUtils]: 29: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1622#true} is VALID [2020-07-08 16:09:23,160 INFO L280 TraceCheckUtils]: 30: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-08 16:09:23,160 INFO L280 TraceCheckUtils]: 31: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,160 INFO L280 TraceCheckUtils]: 32: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-08 16:09:23,160 INFO L280 TraceCheckUtils]: 33: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,164 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #251#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,165 INFO L280 TraceCheckUtils]: 35: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,166 INFO L280 TraceCheckUtils]: 36: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L70-3 {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,166 INFO L263 TraceCheckUtils]: 37: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1622#true} is VALID [2020-07-08 16:09:23,167 INFO L280 TraceCheckUtils]: 38: Hoare triple {1622#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-08 16:09:23,167 INFO L280 TraceCheckUtils]: 39: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,167 INFO L280 TraceCheckUtils]: 40: Hoare triple {1622#true} #res := 0; {1622#true} is VALID [2020-07-08 16:09:23,167 INFO L280 TraceCheckUtils]: 41: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,168 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1622#true} {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #253#return; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,168 INFO L280 TraceCheckUtils]: 43: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,169 INFO L280 TraceCheckUtils]: 44: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #res := 1 + (#t~ret22 + #t~ret24); {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,169 INFO L280 TraceCheckUtils]: 45: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret22; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,170 INFO L280 TraceCheckUtils]: 46: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret24; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,171 INFO L280 TraceCheckUtils]: 47: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem23.base, #t~mem23.offset; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,176 INFO L280 TraceCheckUtils]: 48: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem21.base, #t~mem21.offset; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,179 INFO L280 TraceCheckUtils]: 49: Hoare triple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-08 16:09:23,180 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1685#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1636#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #227#return; {1623#false} is VALID [2020-07-08 16:09:23,180 INFO L280 TraceCheckUtils]: 51: Hoare triple {1623#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647; {1623#false} is VALID [2020-07-08 16:09:23,181 INFO L280 TraceCheckUtils]: 52: Hoare triple {1623#false} ~n~1 := #t~ret26; {1623#false} is VALID [2020-07-08 16:09:23,181 INFO L280 TraceCheckUtils]: 53: Hoare triple {1623#false} havoc #t~ret26; {1623#false} is VALID [2020-07-08 16:09:23,181 INFO L263 TraceCheckUtils]: 54: Hoare triple {1623#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1622#true} is VALID [2020-07-08 16:09:23,181 INFO L280 TraceCheckUtils]: 55: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2020-07-08 16:09:23,182 INFO L280 TraceCheckUtils]: 56: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2020-07-08 16:09:23,182 INFO L280 TraceCheckUtils]: 57: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,182 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {1622#true} {1623#false} #229#return; {1623#false} is VALID [2020-07-08 16:09:23,182 INFO L280 TraceCheckUtils]: 59: Hoare triple {1623#false} SUMMARY for call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L78-1 {1623#false} is VALID [2020-07-08 16:09:23,183 INFO L263 TraceCheckUtils]: 60: Hoare triple {1623#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {1696#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 16:09:23,183 INFO L280 TraceCheckUtils]: 61: Hoare triple {1696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1622#true} is VALID [2020-07-08 16:09:23,183 INFO L280 TraceCheckUtils]: 62: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,184 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1622#true} {1623#false} #231#return; {1623#false} is VALID [2020-07-08 16:09:23,184 INFO L280 TraceCheckUtils]: 64: Hoare triple {1623#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {1623#false} is VALID [2020-07-08 16:09:23,185 INFO L263 TraceCheckUtils]: 65: Hoare triple {1623#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1697#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 16:09:23,186 INFO L280 TraceCheckUtils]: 66: Hoare triple {1697#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1622#true} is VALID [2020-07-08 16:09:23,186 INFO L280 TraceCheckUtils]: 67: Hoare triple {1622#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1622#true} is VALID [2020-07-08 16:09:23,186 INFO L280 TraceCheckUtils]: 68: Hoare triple {1622#true} ~i := #in~i; {1622#true} is VALID [2020-07-08 16:09:23,187 INFO L280 TraceCheckUtils]: 69: Hoare triple {1622#true} assume ~t.base == 0 && ~t.offset == 0; {1622#true} is VALID [2020-07-08 16:09:23,187 INFO L280 TraceCheckUtils]: 70: Hoare triple {1622#true} #res := ~i; {1622#true} is VALID [2020-07-08 16:09:23,187 INFO L280 TraceCheckUtils]: 71: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-08 16:09:23,189 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {1622#true} {1623#false} #233#return; {1623#false} is VALID [2020-07-08 16:09:23,189 INFO L280 TraceCheckUtils]: 73: Hoare triple {1623#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {1623#false} is VALID [2020-07-08 16:09:23,189 INFO L280 TraceCheckUtils]: 74: Hoare triple {1623#false} havoc #t~ret28; {1623#false} is VALID [2020-07-08 16:09:23,189 INFO L280 TraceCheckUtils]: 75: Hoare triple {1623#false} SUMMARY for call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L81 {1623#false} is VALID [2020-07-08 16:09:23,190 INFO L263 TraceCheckUtils]: 76: Hoare triple {1623#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {1623#false} is VALID [2020-07-08 16:09:23,190 INFO L280 TraceCheckUtils]: 77: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2020-07-08 16:09:23,190 INFO L280 TraceCheckUtils]: 78: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2020-07-08 16:09:23,190 INFO L280 TraceCheckUtils]: 79: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2020-07-08 16:09:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 16:09:23,206 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:09:23,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1944970520] [2020-07-08 16:09:23,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:09:23,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-08 16:09:23,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860922615] [2020-07-08 16:09:23,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2020-07-08 16:09:23,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:09:23,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 16:09:23,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:09:23,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 16:09:23,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:09:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 16:09:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-08 16:09:23,328 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 12 states. [2020-07-08 16:09:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:28,156 INFO L93 Difference]: Finished difference Result 316 states and 361 transitions. [2020-07-08 16:09:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 16:09:28,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2020-07-08 16:09:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:09:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 16:09:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 357 transitions. [2020-07-08 16:09:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 16:09:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 357 transitions. [2020-07-08 16:09:28,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 357 transitions. [2020-07-08 16:09:28,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:09:28,697 INFO L225 Difference]: With dead ends: 316 [2020-07-08 16:09:28,698 INFO L226 Difference]: Without dead ends: 187 [2020-07-08 16:09:28,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-07-08 16:09:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-07-08 16:09:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2020-07-08 16:09:29,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:09:29,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 177 states. [2020-07-08 16:09:29,051 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 177 states. [2020-07-08 16:09:29,051 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 177 states. [2020-07-08 16:09:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:29,062 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2020-07-08 16:09:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2020-07-08 16:09:29,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:09:29,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:09:29,065 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 187 states. [2020-07-08 16:09:29,065 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 187 states. [2020-07-08 16:09:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:09:29,076 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2020-07-08 16:09:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2020-07-08 16:09:29,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:09:29,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:09:29,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:09:29,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:09:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-08 16:09:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2020-07-08 16:09:29,087 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 80 [2020-07-08 16:09:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:09:29,088 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2020-07-08 16:09:29,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 16:09:29,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 177 states and 201 transitions. [2020-07-08 16:09:29,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:09:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2020-07-08 16:09:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-07-08 16:09:29,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:09:29,420 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:09:29,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:09:29,424 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:09:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:09:29,425 INFO L82 PathProgramCache]: Analyzing trace with hash 96122912, now seen corresponding path program 1 times [2020-07-08 16:09:29,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:09:29,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214794988] [2020-07-08 16:09:29,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:09:29,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 16:09:29,445 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.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) 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.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) 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:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 16:09:29,451 INFO L168 Benchmark]: Toolchain (without parser) took 15071.11 ms. Allocated memory was 145.8 MB in the beginning and 385.9 MB in the end (delta: 240.1 MB). Free memory was 102.2 MB in the beginning and 235.7 MB in the end (delta: -133.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:29,452 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 16:09:29,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.52 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 102.0 MB in the beginning and 179.1 MB in the end (delta: -77.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:29,453 INFO L168 Benchmark]: Boogie Preprocessor took 70.72 ms. Allocated memory is still 202.9 MB. Free memory was 179.1 MB in the beginning and 175.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:29,454 INFO L168 Benchmark]: RCFGBuilder took 1050.27 ms. Allocated memory is still 202.9 MB. Free memory was 175.8 MB in the beginning and 104.4 MB in the end (delta: 71.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:29,455 INFO L168 Benchmark]: TraceAbstraction took 13487.94 ms. Allocated memory was 202.9 MB in the beginning and 385.9 MB in the end (delta: 183.0 MB). Free memory was 103.8 MB in the beginning and 235.7 MB in the end (delta: -132.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2020-07-08 16:09:29,459 INFO L336 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.23 ms. Allocated memory is still 145.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 455.52 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 102.0 MB in the beginning and 179.1 MB in the end (delta: -77.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.72 ms. Allocated memory is still 202.9 MB. Free memory was 179.1 MB in the beginning and 175.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1050.27 ms. Allocated memory is still 202.9 MB. Free memory was 175.8 MB in the beginning and 104.4 MB in the end (delta: 71.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13487.94 ms. Allocated memory was 202.9 MB in the beginning and 385.9 MB in the end (delta: 183.0 MB). Free memory was 103.8 MB in the beginning and 235.7 MB in the end (delta: -132.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * 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.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...