/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:47:39,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:47:39,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:47:39,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:47:39,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:47:39,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:47:39,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:47:39,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:47:39,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:47:39,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:47:39,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:47:39,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:47:39,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:47:39,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:47:39,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:47:39,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:47:39,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:47:39,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:47:39,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:47:39,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:47:39,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:47:39,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:47:39,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:47:39,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:47:39,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:47:39,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:47:39,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:47:39,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:47:39,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:47:39,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:47:39,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:47:39,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:47:39,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:47:39,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:47:39,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:47:39,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:47:39,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:47:39,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:47:39,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:47:39,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:47:39,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:47:39,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:47:39,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:47:39,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:47:39,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:47:39,864 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:47:39,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:47:39,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:47:39,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:47:39,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:47:39,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:47:39,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:47:39,865 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:47:39,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:47:39,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:47:39,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:47:39,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:47:39,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:47:39,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:47:39,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:47:39,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:47:39,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:47:39,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:47:39,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:47:39,867 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:47:39,867 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-01-31 21:47:40,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:47:40,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:47:40,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:47:40,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:47:40,071 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:47:40,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-01-31 21:47:40,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b00c4444/6989a40a4fc849b38b2792aa1b24525a/FLAGec6d78e4a [2022-01-31 21:47:40,521 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:47:40,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-01-31 21:47:40,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b00c4444/6989a40a4fc849b38b2792aa1b24525a/FLAGec6d78e4a [2022-01-31 21:47:40,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b00c4444/6989a40a4fc849b38b2792aa1b24525a [2022-01-31 21:47:40,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:47:40,946 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:47:40,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:47:40,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:47:40,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:47:40,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:47:40" (1/1) ... [2022-01-31 21:47:40,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613cd1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:40, skipping insertion in model container [2022-01-31 21:47:40,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:47:40" (1/1) ... [2022-01-31 21:47:40,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:47:40,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:47:41,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-01-31 21:47:41,131 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-31 21:47:41,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:47:41,151 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:47:41,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-01-31 21:47:41,167 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-31 21:47:41,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:47:41,186 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:47:41,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41 WrapperNode [2022-01-31 21:47:41,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:47:41,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:47:41,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:47:41,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:47:41,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (1/1) ... [2022-01-31 21:47:41,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (1/1) ... [2022-01-31 21:47:41,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (1/1) ... [2022-01-31 21:47:41,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (1/1) ... [2022-01-31 21:47:41,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (1/1) ... [2022-01-31 21:47:41,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (1/1) ... [2022-01-31 21:47:41,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (1/1) ... [2022-01-31 21:47:41,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:47:41,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:47:41,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:47:41,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:47:41,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (1/1) ... [2022-01-31 21:47:41,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:47:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:47:41,287 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-01-31 21:47:41,306 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-01-31 21:47:41,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:47:41,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:47:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2022-01-31 21:47:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:47:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:47:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-01-31 21:47:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-01-31 21:47:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-01-31 21:47:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-01-31 21:47:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-01-31 21:47:41,334 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-01-31 21:47:41,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:47:41,334 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-01-31 21:47:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-01-31 21:47:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 21:47:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-01-31 21:47:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 21:47:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-01-31 21:47:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2022-01-31 21:47:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:47:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:47:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:47:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:47:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:47:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-01-31 21:47:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 21:47:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-01-31 21:47:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-01-31 21:47:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 21:47:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-01-31 21:47:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:47:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:47:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:47:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:47:41,485 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:47:41,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:47:41,754 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:47:41,760 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:47:41,760 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 21:47:41,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:47:41 BoogieIcfgContainer [2022-01-31 21:47:41,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:47:41,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:47:41,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:47:41,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:47:41,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:47:40" (1/3) ... [2022-01-31 21:47:41,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ff49ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:47:41, skipping insertion in model container [2022-01-31 21:47:41,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:41" (2/3) ... [2022-01-31 21:47:41,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ff49ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:47:41, skipping insertion in model container [2022-01-31 21:47:41,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:47:41" (3/3) ... [2022-01-31 21:47:41,780 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2022-01-31 21:47:41,783 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:47:41,784 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:47:41,825 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:47:41,831 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 21:47:41,831 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:47:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-31 21:47:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:47:41,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:41,858 INFO L514 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] [2022-01-31 21:47:41,858 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 1 times [2022-01-31 21:47:41,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:41,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066084794] [2022-01-31 21:47:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:41,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:41,911 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 21:47:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:47:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:47:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:47:42,255 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:42,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066084794] [2022-01-31 21:47:42,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1066084794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:42,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:42,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:47:42,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129636334] [2022-01-31 21:47:42,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:42,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:47:42,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:47:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:47:42,293 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:47:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:43,072 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-01-31 21:47:43,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:47:43,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-01-31 21:47:43,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:43,083 INFO L225 Difference]: With dead ends: 174 [2022-01-31 21:47:43,083 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 21:47:43,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:47:43,089 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 150 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:43,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 97 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:47:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 21:47:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-01-31 21:47:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-01-31 21:47:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-01-31 21:47:43,138 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2022-01-31 21:47:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:43,139 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-01-31 21:47:43,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:47:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-01-31 21:47:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:47:43,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:43,142 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2022-01-31 21:47:43,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:47:43,142 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 1 times [2022-01-31 21:47:43,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:43,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [733943681] [2022-01-31 21:47:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:43,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:43,147 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:47:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:47:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:47:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 21:47:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:47:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 21:47:43,408 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:43,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [733943681] [2022-01-31 21:47:43,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [733943681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:43,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:43,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:47:43,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121076322] [2022-01-31 21:47:43,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:43,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:47:43,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:43,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:47:43,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:47:43,411 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-31 21:47:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:44,174 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2022-01-31 21:47:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:47:44,175 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2022-01-31 21:47:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:44,177 INFO L225 Difference]: With dead ends: 165 [2022-01-31 21:47:44,177 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 21:47:44,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:47:44,180 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:44,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 84 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:47:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 21:47:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-01-31 21:47:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-01-31 21:47:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-01-31 21:47:44,197 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2022-01-31 21:47:44,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:44,197 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-01-31 21:47:44,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-31 21:47:44,198 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-01-31 21:47:44,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:47:44,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:44,200 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-31 21:47:44,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:47:44,200 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:44,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 1 times [2022-01-31 21:47:44,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:44,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [421625457] [2022-01-31 21:47:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:44,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:44,203 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:47:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:47:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:47:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:47:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 21:47:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 21:47:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 21:47:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 21:47:44,469 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:44,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [421625457] [2022-01-31 21:47:44,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [421625457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:44,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:44,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:47:44,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582905249] [2022-01-31 21:47:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:44,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:47:44,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:44,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:47:44,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:47:44,472 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-01-31 21:47:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:45,130 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-01-31 21:47:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:47:45,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-01-31 21:47:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:45,132 INFO L225 Difference]: With dead ends: 164 [2022-01-31 21:47:45,132 INFO L226 Difference]: Without dead ends: 99 [2022-01-31 21:47:45,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:47:45,134 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:45,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 84 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:47:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-31 21:47:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-01-31 21:47:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-01-31 21:47:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2022-01-31 21:47:45,170 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2022-01-31 21:47:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:45,170 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2022-01-31 21:47:45,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-01-31 21:47:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-01-31 21:47:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 21:47:45,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:45,172 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-31 21:47:45,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:47:45,173 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 1 times [2022-01-31 21:47:45,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [790419111] [2022-01-31 21:47:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:45,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:45,184 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:47:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:47:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:47:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-31 21:47:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:47:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:47:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 21:47:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-31 21:47:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:47:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-31 21:47:45,482 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:45,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [790419111] [2022-01-31 21:47:45,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [790419111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:45,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:45,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:47:45,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75775132] [2022-01-31 21:47:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:45,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:47:45,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:45,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:47:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:47:45,486 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-01-31 21:47:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:46,329 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2022-01-31 21:47:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:47:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 79 [2022-01-31 21:47:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:46,331 INFO L225 Difference]: With dead ends: 152 [2022-01-31 21:47:46,331 INFO L226 Difference]: Without dead ends: 99 [2022-01-31 21:47:46,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:47:46,333 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 192 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:46,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 90 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:47:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-31 21:47:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-01-31 21:47:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-01-31 21:47:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2022-01-31 21:47:46,349 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2022-01-31 21:47:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:46,349 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2022-01-31 21:47:46,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-01-31 21:47:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-01-31 21:47:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-31 21:47:46,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:46,352 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 21:47:46,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:47:46,352 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 1 times [2022-01-31 21:47:46,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:46,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512424646] [2022-01-31 21:47:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:46,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:46,355 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 21:47:46,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 21:47:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 21:47:46,432 INFO L133 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2022-01-31 21:47:46,432 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 21:47:46,435 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:47:46,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:47:46,439 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-01-31 21:47:46,441 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 21:47:46,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:47:46 BoogieIcfgContainer [2022-01-31 21:47:46,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 21:47:46,455 INFO L158 Benchmark]: Toolchain (without parser) took 5509.39ms. Allocated memory was 195.0MB in the beginning and 248.5MB in the end (delta: 53.5MB). Free memory was 139.6MB in the beginning and 101.8MB in the end (delta: 37.8MB). Peak memory consumption was 92.0MB. Max. memory is 8.0GB. [2022-01-31 21:47:46,456 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 21:47:46,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.15ms. Allocated memory is still 195.0MB. Free memory was 139.5MB in the beginning and 164.4MB in the end (delta: -24.9MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-01-31 21:47:46,456 INFO L158 Benchmark]: Boogie Preprocessor took 49.81ms. Allocated memory is still 195.0MB. Free memory was 163.9MB in the beginning and 161.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 21:47:46,457 INFO L158 Benchmark]: RCFGBuilder took 523.91ms. Allocated memory is still 195.0MB. Free memory was 161.8MB in the beginning and 142.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-31 21:47:46,457 INFO L158 Benchmark]: TraceAbstraction took 4692.31ms. Allocated memory was 195.0MB in the beginning and 248.5MB in the end (delta: 53.5MB). Free memory was 141.8MB in the beginning and 101.8MB in the end (delta: 40.1MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. [2022-01-31 21:47:46,459 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.15ms. Allocated memory is still 195.0MB. Free memory was 139.5MB in the beginning and 164.4MB in the end (delta: -24.9MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.81ms. Allocated memory is still 195.0MB. Free memory was 163.9MB in the beginning and 161.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 523.91ms. Allocated memory is still 195.0MB. Free memory was 161.8MB in the beginning and 142.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4692.31ms. Allocated memory was 195.0MB in the beginning and 248.5MB in the end (delta: 53.5MB). Free memory was 141.8MB in the beginning and 101.8MB in the end (delta: 40.1MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L30] RET, EXPR nondet_tree() [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L31] RET, EXPR nondet_tree() [L31] n->right = nondet_tree() [L32] return n; [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left [L41] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->left) [L41] int b = min(n->left); [L42] EXPR n->right [L42] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L42] RET, EXPR min(n->right) [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; [L86] RET, EXPR min(t) [L86] int a = min(t); [L87] int b; [L89] CALL, EXPR size(t) [L81] COND FALSE !(!t) [L82] EXPR t->left [L82] CALL, EXPR size(t->left) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->left) [L82] EXPR t->right [L82] CALL, EXPR size(t->right) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->right) [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) [L70] COND FALSE !(!t) [L73] EXPR t->left [L73] CALL, EXPR tree_inorder(t->left, a, i) [L70] COND TRUE !t [L71] return i; [L73] RET, EXPR tree_inorder(t->left, a, i) [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right [L75] CALL, EXPR tree_inorder(t->right, a, i) [L70] COND TRUE !t [L71] return i; [L75] RET, EXPR tree_inorder(t->right, a, i) [L75] i = tree_inorder(t->right, a, i) [L76] return i; [L92] RET tree_inorder(t, x, n) [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 704 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 666 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3484 IncrementalHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 291 mSDtfsCounter, 3484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-31 21:47:46,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...