./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer --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 9becd42a466bdbd2531661a22b57e70854c9d9ea ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:55:46,955 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:55:46,957 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:55:46,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:55:46,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:55:46,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:55:46,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:55:46,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:55:46,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:55:46,969 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:55:46,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:55:46,970 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:55:46,970 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:55:46,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:55:46,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:55:46,972 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:55:46,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:55:46,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:55:46,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:55:46,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:55:46,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:55:46,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:55:46,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:55:46,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:55:46,980 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:55:46,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:55:46,981 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:55:46,982 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:55:46,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:55:46,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:55:46,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:55:46,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:55:46,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:55:46,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:55:46,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:55:46,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:55:46,986 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 12:55:46,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:55:46,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:55:46,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:55:46,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:55:46,998 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:55:46,998 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:55:46,998 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:55:46,998 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:55:46,998 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:55:46,999 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:55:46,999 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:55:46,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:55:46,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:55:46,999 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:55:46,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:55:46,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:55:47,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:55:47,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:55:47,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:55:47,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:55:47,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:55:47,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:55:47,000 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:55:47,000 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:55:47,001 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:55:47,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:55:47,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:55:47,001 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:55:47,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:55:47,001 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:55:47,001 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:55:47,002 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:55:47,002 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer 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 -> 9becd42a466bdbd2531661a22b57e70854c9d9ea [2018-11-28 12:55:47,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:55:47,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:55:47,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:55:47,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:55:47,039 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:55:47,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-28 12:55:47,081 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/data/1d546ad36/45b83127d10d46c3a9062659b9bbd991/FLAGc54ca3ef4 [2018-11-28 12:55:47,521 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:55:47,521 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-28 12:55:47,532 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/data/1d546ad36/45b83127d10d46c3a9062659b9bbd991/FLAGc54ca3ef4 [2018-11-28 12:55:47,543 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/data/1d546ad36/45b83127d10d46c3a9062659b9bbd991 [2018-11-28 12:55:47,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:55:47,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:55:47,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:55:47,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:55:47,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:55:47,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@251798c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47, skipping insertion in model container [2018-11-28 12:55:47,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:55:47,580 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:55:47,756 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:55:47,765 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:55:47,837 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:55:47,861 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:55:47,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47 WrapperNode [2018-11-28 12:55:47,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:55:47,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:55:47,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:55:47,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:55:47,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:55:47,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:55:47,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:55:47,893 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:55:47,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... [2018-11-28 12:55:47,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:55:47,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:55:47,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:55:47,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:55:47,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/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 [2018-11-28 12:55:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:55:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:55:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:55:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:55:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:55:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:55:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:55:47,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:55:48,121 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:55:48,121 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-28 12:55:48,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:55:48 BoogieIcfgContainer [2018-11-28 12:55:48,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:55:48,122 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:55:48,122 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:55:48,124 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:55:48,125 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:55:48,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:55:47" (1/3) ... [2018-11-28 12:55:48,125 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dfd3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:55:48, skipping insertion in model container [2018-11-28 12:55:48,125 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:55:48,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:47" (2/3) ... [2018-11-28 12:55:48,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dfd3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:55:48, skipping insertion in model container [2018-11-28 12:55:48,126 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:55:48,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:55:48" (3/3) ... [2018-11-28 12:55:48,127 INFO L375 chiAutomizerObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-28 12:55:48,163 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:55:48,164 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:55:48,164 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:55:48,164 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:55:48,164 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:55:48,164 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:55:48,164 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:55:48,164 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:55:48,165 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:55:48,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-28 12:55:48,186 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-28 12:55:48,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:48,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:48,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:55:48,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 12:55:48,191 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:55:48,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-28 12:55:48,192 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-28 12:55:48,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:48,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:48,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:55:48,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 12:55:48,197 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 12#L629true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L621true [2018-11-28 12:55:48,197 INFO L796 eck$LassoCheckResult]: Loop: 5#L621true assume true; 5#L621true [2018-11-28 12:55:48,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:48,201 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-28 12:55:48,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:48,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:48,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:55:48,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:55:48,291 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:55:48,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:48,292 INFO L82 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 1 times [2018-11-28 12:55:48,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:48,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:48,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:48,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:55:48,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:55:48,323 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-11-28 12:55:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:48,339 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-28 12:55:48,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:55:48,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2018-11-28 12:55:48,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 12:55:48,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 17 transitions. [2018-11-28 12:55:48,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 12:55:48,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 12:55:48,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 12:55:48,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:48,346 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 12:55:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 12:55:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 12:55:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 12:55:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-28 12:55:48,364 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 12:55:48,364 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 12:55:48,364 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:55:48,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-28 12:55:48,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 12:55:48,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:48,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:48,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:55:48,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:55:48,366 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 57#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 58#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 53#L633-2 [2018-11-28 12:55:48,366 INFO L796 eck$LassoCheckResult]: Loop: 53#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 55#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 61#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 53#L633-2 [2018-11-28 12:55:48,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash 925733, now seen corresponding path program 1 times [2018-11-28 12:55:48,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:48,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:48,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:48,380 INFO L82 PathProgramCache]: Analyzing trace with hash 49877, now seen corresponding path program 1 times [2018-11-28 12:55:48,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:48,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:48,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:48,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:48,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1808728113, now seen corresponding path program 1 times [2018-11-28 12:55:48,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:48,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:48,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:48,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:48,659 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2018-11-28 12:55:48,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:55:48,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:55:48,751 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:55:48,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:55:48,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:55:48,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:154, output treesize:130 [2018-11-28 12:55:48,894 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:55:48,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:55:48,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:55:48,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:55:48,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:55:48,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:55:48,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:55:48,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:55:48,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i_Iteration2_Lasso [2018-11-28 12:55:48,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:55:48,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:55:48,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:48,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:49,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:49,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:49,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:49,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:55:49,242 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:55:49,245 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:55:49,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:49,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:49,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,254 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:55:49,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,255 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:55:49,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:49,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:49,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:49,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:49,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:49,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:49,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:49,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:49,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:49,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:49,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:49,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:49,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:49,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:49,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:49,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:55:49,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:49,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:49,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:49,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:49,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:49,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:49,318 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:55:49,333 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 12:55:49,333 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:55:49,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:55:49,336 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:55:49,336 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:55:49,337 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2018-11-28 12:55:49,344 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 12:55:49,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:49,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:49,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:49,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 12:55:49,393 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:55:49,420 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2018-11-28 12:55:49,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:55:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:55:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 12:55:49,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 12:55:49,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:49,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 12:55:49,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:49,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 12:55:49,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:49,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-28 12:55:49,425 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2018-11-28 12:55:49,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2018-11-28 12:55:49,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 12:55:49,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:55:49,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-28 12:55:49,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:55:49,426 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 12:55:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-28 12:55:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 12:55:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 12:55:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-11-28 12:55:49,427 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 12:55:49,427 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 12:55:49,427 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:55:49,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-11-28 12:55:49,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2018-11-28 12:55:49,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:49,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:49,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:55:49,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:55:49,429 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 145#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 146#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 139#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 140#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 135#L645-2 [2018-11-28 12:55:49,429 INFO L796 eck$LassoCheckResult]: Loop: 135#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 137#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 134#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 135#L645-2 [2018-11-28 12:55:49,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,429 INFO L82 PathProgramCache]: Analyzing trace with hash 889630004, now seen corresponding path program 1 times [2018-11-28 12:55:49,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash 71723, now seen corresponding path program 1 times [2018-11-28 12:55:49,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1275692520, now seen corresponding path program 1 times [2018-11-28 12:55:49,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:49,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:55:49,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:55:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:55:49,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:55:49,561 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 12:55:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:49,618 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-28 12:55:49,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:55:49,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2018-11-28 12:55:49,619 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2018-11-28 12:55:49,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2018-11-28 12:55:49,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 12:55:49,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 12:55:49,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2018-11-28 12:55:49,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:55:49,622 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-28 12:55:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2018-11-28 12:55:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-11-28 12:55:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 12:55:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-11-28 12:55:49,628 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-28 12:55:49,628 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-28 12:55:49,628 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:55:49,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2018-11-28 12:55:49,629 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2018-11-28 12:55:49,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:49,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:49,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:55:49,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 12:55:49,629 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 208#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 206#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 207#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 199#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 202#L636 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 205#L621-1 [2018-11-28 12:55:49,629 INFO L796 eck$LassoCheckResult]: Loop: 205#L621-1 assume true; 205#L621-1 [2018-11-28 12:55:49,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash 889630056, now seen corresponding path program 1 times [2018-11-28 12:55:49,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:49,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:55:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:55:49,662 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:55:49,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2018-11-28 12:55:49,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:55:49,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:55:49,677 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 12:55:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:49,681 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-28 12:55:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:55:49,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-28 12:55:49,682 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2018-11-28 12:55:49,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2018-11-28 12:55:49,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 12:55:49,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 12:55:49,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 12:55:49,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:49,683 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 12:55:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 12:55:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-28 12:55:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 12:55:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 12:55:49,684 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 12:55:49,684 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 12:55:49,684 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:55:49,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-28 12:55:49,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 12:55:49,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:49,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:49,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:49,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 12:55:49,685 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 247#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 248#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 242#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 243#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 239#L645-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 240#L645-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 241#L654-2 [2018-11-28 12:55:49,685 INFO L796 eck$LassoCheckResult]: Loop: 241#L654-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 241#L654-2 [2018-11-28 12:55:49,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash 235943235, now seen corresponding path program 1 times [2018-11-28 12:55:49,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:49,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:55:49,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:55:49,704 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:55:49,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,704 INFO L82 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2018-11-28 12:55:49,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:55:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:55:49,735 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 12:55:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:49,754 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-28 12:55:49,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:55:49,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2018-11-28 12:55:49,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 12:55:49,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2018-11-28 12:55:49,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 12:55:49,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 12:55:49,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-28 12:55:49,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:49,756 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-28 12:55:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-28 12:55:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-11-28 12:55:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 12:55:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 12:55:49,758 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 12:55:49,758 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 12:55:49,758 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:55:49,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-28 12:55:49,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 12:55:49,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:49,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:49,758 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:49,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:55:49,759 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 296#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 294#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 295#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 290#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 291#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 298#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 292#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 293#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 286#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L646 [2018-11-28 12:55:49,759 INFO L796 eck$LassoCheckResult]: Loop: 287#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 284#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 285#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L646 [2018-11-28 12:55:49,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash -840462870, now seen corresponding path program 1 times [2018-11-28 12:55:49,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash 78503, now seen corresponding path program 2 times [2018-11-28 12:55:49,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:49,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:49,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1430024222, now seen corresponding path program 1 times [2018-11-28 12:55:49,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:49,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:49,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:49,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:49,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:55:49,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:55:49,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:49,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:49,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:55:49,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:49,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:49,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:55:49,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:49,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:49,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:55:49,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:49,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:55:49,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:55:49,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:49,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:49,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:49,977 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2018-11-28 12:55:49,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:55:49,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:49,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:55:49,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:49,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2018-11-28 12:55:50,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 12:55:50,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-28 12:55:50,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:50,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:55:50,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,035 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:14 [2018-11-28 12:55:50,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 12:55:50,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 12:55:50,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-28 12:55:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:50,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:55:50,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-28 12:55:50,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:55:50,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:55:50,104 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-11-28 12:55:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:50,232 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-28 12:55:50,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:55:50,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-28 12:55:50,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 12:55:50,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2018-11-28 12:55:50,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 12:55:50,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 12:55:50,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-28 12:55:50,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:50,234 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-28 12:55:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-28 12:55:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-11-28 12:55:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 12:55:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 12:55:50,236 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 12:55:50,236 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 12:55:50,236 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:55:50,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-28 12:55:50,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 12:55:50,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:50,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:50,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:50,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:55:50,237 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 400#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 398#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 399#L629-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 393#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 394#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 402#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 395#L633-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 396#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 404#L636-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 403#L633-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 397#L633-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 389#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 390#L646 [2018-11-28 12:55:50,237 INFO L796 eck$LassoCheckResult]: Loop: 390#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 387#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 388#L645-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 390#L646 [2018-11-28 12:55:50,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1481323766, now seen corresponding path program 2 times [2018-11-28 12:55:50,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:50,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:50,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:50,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:50,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:50,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:50,265 INFO L82 PathProgramCache]: Analyzing trace with hash 78503, now seen corresponding path program 3 times [2018-11-28 12:55:50,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:50,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:50,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:50,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:50,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:50,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash -672604782, now seen corresponding path program 2 times [2018-11-28 12:55:50,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:50,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:50,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:50,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:55:50,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_646a96f1-bbbe-4d7e-92f3-f91257b2574f/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:55:50,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:55:50,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:55:50,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:55:50,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:50,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:55:50,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:55:50,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:50,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:50,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:55:50,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:55:50,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:55:50,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,495 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-28 12:55:50,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 12:55:50,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:50,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:55:50,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-28 12:55:50,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:50,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:50,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:55:50,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 12:55:50,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:55:50,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,573 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-11-28 12:55:50,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 12:55:50,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-28 12:55:50,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-11-28 12:55:50,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 12:55:50,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-28 12:55:50,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:55:50,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 12:55:50,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-11-28 12:55:50,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 12:55:50,642 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:55:50,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:55:50,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:55:50,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2018-11-28 12:55:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:50,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:55:50,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-28 12:55:50,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:55:50,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:55:50,699 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2018-11-28 12:55:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:50,768 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-28 12:55:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:55:50,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. [2018-11-28 12:55:50,769 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:55:50,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2018-11-28 12:55:50,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:55:50,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:55:50,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:55:50,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:50,769 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:55:50,769 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:55:50,769 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:55:50,769 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:55:50,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:55:50,769 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:55:50,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:55:50,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:55:50 BoogieIcfgContainer [2018-11-28 12:55:50,774 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:55:50,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:55:50,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:55:50,774 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:55:50,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:55:48" (3/4) ... [2018-11-28 12:55:50,776 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:55:50,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:55:50,777 INFO L168 Benchmark]: Toolchain (without parser) took 3231.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.6 MB in the beginning and 863.5 MB in the end (delta: 87.1 MB). Peak memory consumption was 224.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:55:50,777 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:55:50,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:55:50,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:55:50,778 INFO L168 Benchmark]: Boogie Preprocessor took 17.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:55:50,779 INFO L168 Benchmark]: RCFGBuilder took 210.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:55:50,779 INFO L168 Benchmark]: BuchiAutomizer took 2651.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 863.5 MB in the end (delta: 235.1 MB). Peak memory consumption was 235.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:55:50,779 INFO L168 Benchmark]: Witness Printer took 2.57 ms. Allocated memory is still 1.2 GB. Free memory is still 863.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:55:50,781 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 210.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2651.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 863.5 MB in the end (delta: 235.1 MB). Peak memory consumption was 235.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.57 ms. Allocated memory is still 1.2 GB. Free memory is still 863.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 128 SDslu, 60 SDs, 0 SdLazy, 227 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax100 hnf100 lsp94 ukn48 mio100 lsp26 div100 bol100 ite100 ukn100 eq209 hnf91 smp100 dnf166 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...