./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43439d71f7b47b10e5196ff582d5d2564aed0e67 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:19:16,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:19:16,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:19:16,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:19:16,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:19:16,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:19:16,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:19:16,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:19:16,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:19:16,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:19:16,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:19:16,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:19:16,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:19:16,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:19:16,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:19:16,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:19:16,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:19:16,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:19:16,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:19:16,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:19:16,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:19:16,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:19:16,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:19:16,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:19:16,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:19:16,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:19:16,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:19:16,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:19:16,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:19:16,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:19:16,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:19:16,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:19:16,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:19:16,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:19:16,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:19:16,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:19:16,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:19:16,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:19:16,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:19:16,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:19:16,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:19:16,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:19:16,959 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:19:16,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:19:16,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:19:16,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:19:16,962 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:19:16,962 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:19:16,962 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:19:16,963 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:19:16,963 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:19:16,963 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:19:16,964 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:19:16,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:19:16,965 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:19:16,965 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:19:16,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:19:16,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:19:16,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:19:16,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:19:16,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:19:16,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:19:16,967 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:19:16,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:19:16,968 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:19:16,968 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:19:16,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:19:16,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:19:16,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:19:16,969 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:19:16,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:19:16,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:19:16,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:19:16,970 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:19:16,971 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:19:16,971 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 43439d71f7b47b10e5196ff582d5d2564aed0e67 [2020-10-20 08:19:17,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:19:17,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:19:17,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:19:17,174 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:19:17,174 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:19:17,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2020-10-20 08:19:17,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628215fba/b91d52f6424647c58aece892a1273555/FLAGbbc53cecb [2020-10-20 08:19:17,829 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:19:17,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2020-10-20 08:19:17,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628215fba/b91d52f6424647c58aece892a1273555/FLAGbbc53cecb [2020-10-20 08:19:18,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628215fba/b91d52f6424647c58aece892a1273555 [2020-10-20 08:19:18,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:19:18,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:19:18,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:18,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:19:18,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:19:18,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43984c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18, skipping insertion in model container [2020-10-20 08:19:18,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:19:18,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:19:18,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:18,564 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:19:18,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:19:18,688 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:19:18,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18 WrapperNode [2020-10-20 08:19:18,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:19:18,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:18,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:19:18,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:19:18,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:19:18,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:19:18,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:19:18,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:19:18,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (1/1) ... [2020-10-20 08:19:18,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:19:18,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:19:18,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:19:18,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:19:18,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:19:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 08:19:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 08:19:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:19:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 08:19:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:19:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:19:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:19:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:19:19,515 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:19:19,516 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 08:19:19,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:19 BoogieIcfgContainer [2020-10-20 08:19:19,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:19:19,519 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:19:19,519 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:19:19,522 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:19:19,523 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:19,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:19:18" (1/3) ... [2020-10-20 08:19:19,525 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d170d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:19, skipping insertion in model container [2020-10-20 08:19:19,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:19,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:19:18" (2/3) ... [2020-10-20 08:19:19,525 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d170d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:19:19, skipping insertion in model container [2020-10-20 08:19:19,526 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:19:19,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:19" (3/3) ... [2020-10-20 08:19:19,528 INFO L373 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2020-10-20 08:19:19,573 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:19:19,574 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:19:19,574 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:19:19,574 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:19:19,575 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:19:19,575 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:19:19,575 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:19:19,575 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:19:19,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-20 08:19:19,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 08:19:19,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:19,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:19,615 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:19,616 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:19:19,616 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:19:19,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-10-20 08:19:19,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 08:19:19,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:19,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:19,619 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:19,619 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:19:19,627 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 10#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 18#L552-2true [2020-10-20 08:19:19,627 INFO L796 eck$LassoCheckResult]: Loop: 18#L552-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 20#L541-2true assume !true; 7#L540-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 6#L546true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem18.base, 8 + main_#t~mem18.offset, 4);havoc main_#t~mem18.base, main_#t~mem18.offset; 9#L546-2true call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 13#L552true assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 18#L552-2true [2020-10-20 08:19:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 08:19:19,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:19,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783467238] [2020-10-20 08:19:19,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,774 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,809 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:19,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:19,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-10-20 08:19:19,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:19,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484223730] [2020-10-20 08:19:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:19,847 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-20 08:19:19,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484223730] [2020-10-20 08:19:19,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:19,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:19:19,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439887530] [2020-10-20 08:19:19,855 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:19,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 08:19:19,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 08:19:19,874 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-10-20 08:19:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:19,882 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-10-20 08:19:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:19:19,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2020-10-20 08:19:19,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 08:19:19,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2020-10-20 08:19:19,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:19:19,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:19:19,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2020-10-20 08:19:19,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:19,893 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:19:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2020-10-20 08:19:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-20 08:19:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:19:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-10-20 08:19:19,922 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:19:19,923 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:19:19,923 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:19:19,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2020-10-20 08:19:19,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 08:19:19,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:19,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:19,925 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:19,925 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:19,925 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 61#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 62#L552-2 [2020-10-20 08:19:19,926 INFO L796 eck$LassoCheckResult]: Loop: 62#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 65#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 66#L540-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 50#L540-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 51#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 57#L546 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset;call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem18.base, 8 + main_#t~mem18.offset, 4);havoc main_#t~mem18.base, main_#t~mem18.offset; 58#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 60#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 62#L552-2 [2020-10-20 08:19:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 08:19:19,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:19,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594083969] [2020-10-20 08:19:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:19,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:19,971 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:19,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-10-20 08:19:19,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:19,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904986718] [2020-10-20 08:19:19,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:20,103 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-20 08:19:20,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904986718] [2020-10-20 08:19:20,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:20,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:20,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571177543] [2020-10-20 08:19:20,105 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:19:20,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:20,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:20,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:20,106 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-20 08:19:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:20,303 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-10-20 08:19:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:19:20,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-10-20 08:19:20,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-10-20 08:19:20,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2020-10-20 08:19:20,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 08:19:20,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 08:19:20,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2020-10-20 08:19:20,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:20,310 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-10-20 08:19:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2020-10-20 08:19:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-10-20 08:19:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:19:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-10-20 08:19:20,314 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:19:20,314 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:19:20,314 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:19:20,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-10-20 08:19:20,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 08:19:20,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:20,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:20,316 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:20,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:20,316 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 114#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 115#L552-2 [2020-10-20 08:19:20,317 INFO L796 eck$LassoCheckResult]: Loop: 115#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 118#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 119#L540-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 101#L540-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 102#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 108#L546 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 109#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 113#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 115#L552-2 [2020-10-20 08:19:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 08:19:20,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449009911] [2020-10-20 08:19:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,353 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-10-20 08:19:20,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672080551] [2020-10-20 08:19:20,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:20,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:20,377 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-10-20 08:19:20,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:20,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941664922] [2020-10-20 08:19:20,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:19:20,489 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-20 08:19:20,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941664922] [2020-10-20 08:19:20,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:19:20,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:19:20,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732773068] [2020-10-20 08:19:20,683 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-10-20 08:19:20,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:19:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:19:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:19:20,740 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-10-20 08:19:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:19:21,060 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-10-20 08:19:21,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:19:21,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2020-10-20 08:19:21,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-10-20 08:19:21,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2020-10-20 08:19:21,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 08:19:21,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-20 08:19:21,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2020-10-20 08:19:21,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:19:21,064 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2020-10-20 08:19:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2020-10-20 08:19:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-10-20 08:19:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 08:19:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-10-20 08:19:21,068 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-20 08:19:21,069 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-10-20 08:19:21,069 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:19:21,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-10-20 08:19:21,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-10-20 08:19:21,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:19:21,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:19:21,071 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:19:21,071 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:19:21,071 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(18); 180#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~nondet6, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(12);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 181#L552-2 [2020-10-20 08:19:21,071 INFO L796 eck$LassoCheckResult]: Loop: 181#L552-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 192#L541-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 189#L540-1 assume !main_#t~short9; 190#L540-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 195#L540-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L546 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 178#L546-2 call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 179#L552 assume !((main_#t~mem19.base == 0 && main_#t~mem19.offset == 0) && 0 != main_#t~nondet20);havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~nondet20; 181#L552-2 [2020-10-20 08:19:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 08:19:21,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244937656] [2020-10-20 08:19:21,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,113 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-10-20 08:19:21,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643209003] [2020-10-20 08:19:21,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,154 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:19:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-10-20 08:19:21,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:19:21,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415777287] [2020-10-20 08:19:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:19:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:19:21,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:19:21,234 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:19:21,365 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-10-20 08:19:21,994 WARN L193 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 103 [2020-10-20 08:19:22,047 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:22,249 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-20 08:19:22,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:22,258 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:22,432 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-20 08:19:22,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:19:22,434 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 08:19:22,434 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:216, output treesize:190 [2020-10-20 08:19:22,615 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-20 08:19:22,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:19:22 BoogieIcfgContainer [2020-10-20 08:19:22,689 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:19:22,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:19:22,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:19:22,692 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:19:22,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:19:19" (3/4) ... [2020-10-20 08:19:22,696 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:19:22,749 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:19:22,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:19:22,752 INFO L168 Benchmark]: Toolchain (without parser) took 4568.92 ms. Allocated memory was 43.5 MB in the beginning and 59.8 MB in the end (delta: 16.3 MB). Free memory was 22.5 MB in the beginning and 16.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,753 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 32.5 MB. Free memory was 10.9 MB in the beginning and 10.9 MB in the end (delta: 45.5 kB). Peak memory consumption was 45.5 kB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.78 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 21.6 MB in the beginning and 27.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 10.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.08 ms. Allocated memory is still 45.6 MB. Free memory was 27.7 MB in the beginning and 25.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,756 INFO L168 Benchmark]: Boogie Preprocessor took 33.69 ms. Allocated memory is still 45.6 MB. Free memory was 25.3 MB in the beginning and 23.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,757 INFO L168 Benchmark]: RCFGBuilder took 734.30 ms. Allocated memory was 45.6 MB in the beginning and 47.2 MB in the end (delta: 1.6 MB). Free memory was 23.2 MB in the beginning and 25.5 MB in the end (delta: -2.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,758 INFO L168 Benchmark]: BuchiAutomizer took 3170.75 ms. Allocated memory was 47.2 MB in the beginning and 59.8 MB in the end (delta: 12.6 MB). Free memory was 25.2 MB in the beginning and 18.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,759 INFO L168 Benchmark]: Witness Printer took 57.58 ms. Allocated memory is still 59.8 MB. Free memory was 18.5 MB in the beginning and 16.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:19:22,765 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.27 ms. Allocated memory is still 32.5 MB. Free memory was 10.9 MB in the beginning and 10.9 MB in the end (delta: 45.5 kB). Peak memory consumption was 45.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 499.78 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 21.6 MB in the beginning and 27.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 10.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 60.08 ms. Allocated memory is still 45.6 MB. Free memory was 27.7 MB in the beginning and 25.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 33.69 ms. Allocated memory is still 45.6 MB. Free memory was 25.3 MB in the beginning and 23.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 734.30 ms. Allocated memory was 45.6 MB in the beginning and 47.2 MB in the end (delta: 1.6 MB). Free memory was 23.2 MB in the beginning and 25.5 MB in the end (delta: -2.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 3170.75 ms. Allocated memory was 47.2 MB in the beginning and 59.8 MB in the end (delta: 12.6 MB). Free memory was 25.2 MB in the beginning and 18.5 MB in the end (delta: 6.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 14.3 GB. * Witness Printer took 57.58 ms. Allocated memory is still 59.8 MB. Free memory was 18.5 MB in the beginning and 16.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.4s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=21279} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b8a6cfd=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@86e6135=0, NULL=21281, NULL=21279, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e285c89=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7465f3a1=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33fb51d2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@180fa35=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b8a6cfd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58e60404=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3752da7c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5eeec63b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@164547e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@180fa35=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7858a6e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3586103f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48e15e80=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3586103f=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7465f3a1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33fb51d2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bcf2366=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@10e6b2eb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71fceca=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c318acb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9d25bcc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48e15e80=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63c6bb68=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@d88462f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bcf2366=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e285c89=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79c8075a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4e9a0b6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71fceca=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4e9a0b6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b2d9d60=29, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@10e6b2eb=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@86e6135=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3752da7c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d1cf93d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@543c407c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9d25bcc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@d88462f=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@161a460d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79c8075a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@543c407c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d1cf93d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7858a6e8=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5eeec63b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69d2c468=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@322a4f74=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63c6bb68=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@322a4f74=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39ad963e=0, NULL=21280, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69d2c468=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@c318acb=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 538]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...