./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_iter.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3996209b60f87d3e4d0d43d86633911b8e11add8 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 22:32:01,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:32:01,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:32:01,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:32:01,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:32:01,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:32:01,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:32:01,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:32:01,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:32:01,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:32:01,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:32:01,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:32:01,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:32:01,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:32:01,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:32:01,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:32:01,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:32:01,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:32:01,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:32:01,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:32:01,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:32:01,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:32:01,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:32:01,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:32:01,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:32:01,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:32:01,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:32:01,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:32:01,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:32:01,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:32:01,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:32:01,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:32:01,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:32:01,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:32:01,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:32:01,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:32:01,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:32:01,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:32:01,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:32:01,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:32:01,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:32:01,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:32:01,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:32:01,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:32:01,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:32:01,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:32:01,890 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:32:01,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:32:01,891 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:32:01,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:32:01,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:32:01,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:32:01,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:32:01,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:32:01,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:32:01,897 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:32:01,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:32:01,897 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:32:01,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:32:01,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:32:01,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:32:01,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:32:01,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:32:01,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:32:01,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:32:01,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:32:01,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:32:01,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:32:01,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:32:01,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:32:01,901 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:32:01,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3996209b60f87d3e4d0d43d86633911b8e11add8 [2020-10-25 22:32:02,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:32:02,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:32:02,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:32:02,368 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:32:02,369 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:32:02,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter.c [2020-10-25 22:32:02,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca1925d1/2e95e4834f024660a22db68ee94b8608/FLAGbc7f4ac72 [2020-10-25 22:32:03,052 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:32:03,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2020-10-25 22:32:03,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca1925d1/2e95e4834f024660a22db68ee94b8608/FLAGbc7f4ac72 [2020-10-25 22:32:03,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca1925d1/2e95e4834f024660a22db68ee94b8608 [2020-10-25 22:32:03,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:32:03,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:32:03,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:32:03,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:32:03,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:32:03,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e970dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03, skipping insertion in model container [2020-10-25 22:32:03,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:32:03,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:32:03,662 WARN L1500 CHandler]: Possible shadowing of function min [2020-10-25 22:32:03,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:32:03,698 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:32:03,724 WARN L1500 CHandler]: Possible shadowing of function min [2020-10-25 22:32:03,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:32:03,761 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:32:03,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03 WrapperNode [2020-10-25 22:32:03,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:32:03,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:32:03,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:32:03,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:32:03,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:32:03,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:32:03,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:32:03,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:32:03,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (1/1) ... [2020-10-25 22:32:03,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:32:03,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:32:03,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:32:03,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:32:03,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (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-10-25 22:32:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-25 22:32:04,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:32:04,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-25 22:32:04,007 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-10-25 22:32:04,007 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-10-25 22:32:04,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 22:32:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-25 22:32:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-10-25 22:32:04,011 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-10-25 22:32:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:32:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-25 22:32:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-10-25 22:32:04,012 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-10-25 22:32:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:32:04,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:32:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-10-25 22:32:04,013 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-10-25 22:32:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 22:32:04,935 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:32:04,935 INFO L298 CfgBuilder]: Removed 33 assume(true) statements. [2020-10-25 22:32:04,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:32:04 BoogieIcfgContainer [2020-10-25 22:32:04,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:32:04,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:32:04,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:32:04,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:32:04,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:32:03" (1/3) ... [2020-10-25 22:32:04,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f09bb6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:32:04, skipping insertion in model container [2020-10-25 22:32:04,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:32:03" (2/3) ... [2020-10-25 22:32:04,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f09bb6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:32:04, skipping insertion in model container [2020-10-25 22:32:04,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:32:04" (3/3) ... [2020-10-25 22:32:04,949 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2020-10-25 22:32:04,961 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:32:04,970 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-10-25 22:32:04,986 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-25 22:32:05,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:32:05,024 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:32:05,024 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:32:05,025 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:32:05,025 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:32:05,025 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:32:05,025 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:32:05,025 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:32:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2020-10-25 22:32:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 22:32:05,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:32:05,057 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] [2020-10-25 22:32:05,057 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:32:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:32:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash -209466115, now seen corresponding path program 1 times [2020-10-25 22:32:05,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:32:05,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690574596] [2020-10-25 22:32:05,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:32:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:05,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 22:32:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:05,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-25 22:32:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:05,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-25 22:32:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:05,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-25 22:32:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:32:05,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690574596] [2020-10-25 22:32:05,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:32:05,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-25 22:32:05,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54006837] [2020-10-25 22:32:05,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 22:32:05,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:32:05,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 22:32:05,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:32:05,527 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 7 states. [2020-10-25 22:32:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:32:06,009 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2020-10-25 22:32:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:32:06,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-10-25 22:32:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:32:06,026 INFO L225 Difference]: With dead ends: 146 [2020-10-25 22:32:06,027 INFO L226 Difference]: Without dead ends: 81 [2020-10-25 22:32:06,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:32:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-25 22:32:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2020-10-25 22:32:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-25 22:32:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2020-10-25 22:32:06,130 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 30 [2020-10-25 22:32:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:32:06,131 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2020-10-25 22:32:06,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 22:32:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2020-10-25 22:32:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-25 22:32:06,136 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:32:06,137 INFO L422 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] [2020-10-25 22:32:06,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:32:06,137 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:32:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:32:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1135307658, now seen corresponding path program 1 times [2020-10-25 22:32:06,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:32:06,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317962412] [2020-10-25 22:32:06,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:32:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:06,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 22:32:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:06,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-25 22:32:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:06,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-25 22:32:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:06,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 22:32:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:06,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-25 22:32:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:06,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-25 22:32:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 22:32:06,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317962412] [2020-10-25 22:32:06,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705034575] [2020-10-25 22:32:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:32:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:06,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-25 22:32:06,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:32:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 22:32:06,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:32:06,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2020-10-25 22:32:06,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569132254] [2020-10-25 22:32:06,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 22:32:06,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:32:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 22:32:06,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:32:06,772 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand 9 states. [2020-10-25 22:32:07,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:32:07,309 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2020-10-25 22:32:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 22:32:07,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-10-25 22:32:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:32:07,313 INFO L225 Difference]: With dead ends: 137 [2020-10-25 22:32:07,314 INFO L226 Difference]: Without dead ends: 81 [2020-10-25 22:32:07,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:32:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-25 22:32:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2020-10-25 22:32:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-25 22:32:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2020-10-25 22:32:07,333 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 42 [2020-10-25 22:32:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:32:07,334 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2020-10-25 22:32:07,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 22:32:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2020-10-25 22:32:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-25 22:32:07,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:32:07,337 INFO L422 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] [2020-10-25 22:32:07,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-10-25 22:32:07,553 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:32:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:32:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash 637081529, now seen corresponding path program 1 times [2020-10-25 22:32:07,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:32:07,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570124432] [2020-10-25 22:32:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:32:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 22:32:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-25 22:32:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-25 22:32:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-25 22:32:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 22:32:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 22:32:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-25 22:32:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-25 22:32:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-25 22:32:07,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570124432] [2020-10-25 22:32:07,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:32:07,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-25 22:32:07,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101281423] [2020-10-25 22:32:07,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 22:32:07,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:32:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 22:32:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-25 22:32:07,879 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 10 states. [2020-10-25 22:32:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:32:08,338 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2020-10-25 22:32:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:32:08,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-10-25 22:32:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:32:08,342 INFO L225 Difference]: With dead ends: 137 [2020-10-25 22:32:08,342 INFO L226 Difference]: Without dead ends: 83 [2020-10-25 22:32:08,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-10-25 22:32:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-25 22:32:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-10-25 22:32:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-25 22:32:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2020-10-25 22:32:08,359 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 52 [2020-10-25 22:32:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:32:08,360 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2020-10-25 22:32:08,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 22:32:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2020-10-25 22:32:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-25 22:32:08,363 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:32:08,363 INFO L422 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] [2020-10-25 22:32:08,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:32:08,363 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:32:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:32:08,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1012320298, now seen corresponding path program 1 times [2020-10-25 22:32:08,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:32:08,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719173223] [2020-10-25 22:32:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:32:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 22:32:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-25 22:32:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-25 22:32:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-25 22:32:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 22:32:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-25 22:32:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-10-25 22:32:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 22:32:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-25 22:32:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-10-25 22:32:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-25 22:32:08,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719173223] [2020-10-25 22:32:08,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638227939] [2020-10-25 22:32:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:32:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:32:08,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-25 22:32:08,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:32:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-25 22:32:08,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:32:08,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2020-10-25 22:32:08,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339304425] [2020-10-25 22:32:08,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 22:32:08,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:32:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 22:32:08,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:32:08,998 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand 15 states. [2020-10-25 22:32:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:32:09,897 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2020-10-25 22:32:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-25 22:32:09,898 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2020-10-25 22:32:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:32:09,900 INFO L225 Difference]: With dead ends: 132 [2020-10-25 22:32:09,901 INFO L226 Difference]: Without dead ends: 85 [2020-10-25 22:32:09,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2020-10-25 22:32:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-25 22:32:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2020-10-25 22:32:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-25 22:32:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2020-10-25 22:32:09,916 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 65 [2020-10-25 22:32:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:32:09,916 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2020-10-25 22:32:09,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 22:32:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2020-10-25 22:32:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-25 22:32:09,922 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:32:09,922 INFO L422 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] [2020-10-25 22:32:10,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:32:10,136 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:32:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:32:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash 417898793, now seen corresponding path program 1 times [2020-10-25 22:32:10,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:32:10,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85493545] [2020-10-25 22:32:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:32:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:32:10,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:32:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:32:10,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:32:10,266 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 22:32:10,266 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 22:32:10,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:32:10,295 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,296 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,297 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,297 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,302 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,302 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,303 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,303 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,304 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,304 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,304 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,304 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:32:10 BoogieIcfgContainer [2020-10-25 22:32:10,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:32:10,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:32:10,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:32:10,357 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:32:10,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:32:04" (3/4) ... [2020-10-25 22:32:10,368 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 22:32:10,377 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,377 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,377 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,378 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,382 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,383 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,383 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,384 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,384 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,384 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,385 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,385 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 22:32:10,515 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:32:10,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:32:10,518 INFO L168 Benchmark]: Toolchain (without parser) took 7121.64 ms. Allocated memory was 39.8 MB in the beginning and 104.9 MB in the end (delta: 65.0 MB). Free memory was 16.5 MB in the beginning and 83.4 MB in the end (delta: -67.0 MB). Peak memory consumption was 57.4 MB. Max. memory is 16.1 GB. [2020-10-25 22:32:10,518 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 39.8 MB. Free memory is still 26.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:32:10,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.29 ms. Allocated memory is still 48.2 MB. Free memory was 33.0 MB in the beginning and 21.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-10-25 22:32:10,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.73 ms. Allocated memory is still 48.2 MB. Free memory was 21.2 MB in the beginning and 31.4 MB in the end (delta: -10.1 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. [2020-10-25 22:32:10,520 INFO L168 Benchmark]: Boogie Preprocessor took 59.51 ms. Allocated memory is still 48.2 MB. Free memory was 31.4 MB in the beginning and 29.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:32:10,520 INFO L168 Benchmark]: RCFGBuilder took 1045.18 ms. Allocated memory is still 48.2 MB. Free memory was 29.2 MB in the beginning and 21.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2020-10-25 22:32:10,521 INFO L168 Benchmark]: TraceAbstraction took 5416.22 ms. Allocated memory was 48.2 MB in the beginning and 104.9 MB in the end (delta: 56.6 MB). Free memory was 21.4 MB in the beginning and 33.3 MB in the end (delta: -11.9 MB). Peak memory consumption was 44.7 MB. Max. memory is 16.1 GB. [2020-10-25 22:32:10,522 INFO L168 Benchmark]: Witness Printer took 158.94 ms. Allocated memory is still 104.9 MB. Free memory was 33.3 MB in the beginning and 83.4 MB in the end (delta: -50.1 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. [2020-10-25 22:32:10,527 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.34 ms. Allocated memory is still 39.8 MB. Free memory is still 26.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 352.29 ms. Allocated memory is still 48.2 MB. Free memory was 33.0 MB in the beginning and 21.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.73 ms. Allocated memory is still 48.2 MB. Free memory was 21.2 MB in the beginning and 31.4 MB in the end (delta: -10.1 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.51 ms. Allocated memory is still 48.2 MB. Free memory was 31.4 MB in the beginning and 29.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1045.18 ms. Allocated memory is still 48.2 MB. Free memory was 29.2 MB in the beginning and 21.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5416.22 ms. Allocated memory was 48.2 MB in the beginning and 104.9 MB in the end (delta: 56.6 MB). Free memory was 21.4 MB in the beginning and 33.3 MB in the end (delta: -11.9 MB). Peak memory consumption was 44.7 MB. Max. memory is 16.1 GB. * Witness Printer took 158.94 ms. Allocated memory is still 104.9 MB. Free memory was 33.3 MB in the beginning and 83.4 MB in the end (delta: -50.1 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L110] CALL 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; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L110] RET nondet_tree() [L86] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L86] RET, EXPR min(t) [L86] int a = min(t); [L87] int b; [L89] CALL, EXPR size(t) VAL [t={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L82] CALL, EXPR size(t->left) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L82] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L82] CALL, EXPR size(t->right) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) [L89] int n = size(t); [L9] COND FALSE !(!cond) [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L92] RET tree_inorder(t, x, n) [L93] x[0] [L16] COND TRUE !cond [L14] __assert_fail("0", "tree_del_iter.c", 14, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 84 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 311 SDtfs, 330 SDslu, 1436 SDs, 0 SdLazy, 1192 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 153 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, 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, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 48598 SizeOfPredicates, 16 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 103/111 InterpolantCoveringCapability, 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! Received shutdown request...