./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec1_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec1_product24.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/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 f6103b74ce18f230972d65a7f322c96917948475 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:58,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:58,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:58,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:58,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:58,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:58,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:58,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:58,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:58,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:58,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:58,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:58,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:58,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:58,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:58,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:58,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:58,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:58,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:58,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:58,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:58,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:58,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:58,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:58,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:58,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:58,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:58,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:58,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:58,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:58,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:58,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:58,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:58,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:58,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:58,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:58,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:58,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:58,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:58,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:58,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:58,878 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:01:58,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:58,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:58,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:58,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:58,901 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:58,901 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:58,902 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:58,902 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:58,902 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:58,902 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:58,902 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:58,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:58,902 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:58,903 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:58,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:58,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:58,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:58,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:58,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:58,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:58,903 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:58,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:58,904 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:58,904 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:58,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:58,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:58,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:58,904 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:58,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:58,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:58,905 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:58,906 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:58,906 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/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 -> f6103b74ce18f230972d65a7f322c96917948475 [2019-10-22 09:01:58,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:58,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:58,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:58,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:58,957 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:58,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec1_product24.cil.c [2019-10-22 09:01:59,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/data/06517aad9/afcfdaf167834748a0a6bb64c6e2da83/FLAG2883d4c99 [2019-10-22 09:01:59,606 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:59,606 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/sv-benchmarks/c/product-lines/elevator_spec1_product24.cil.c [2019-10-22 09:01:59,622 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/data/06517aad9/afcfdaf167834748a0a6bb64c6e2da83/FLAG2883d4c99 [2019-10-22 09:01:59,814 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/data/06517aad9/afcfdaf167834748a0a6bb64c6e2da83 [2019-10-22 09:01:59,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:59,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:59,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:59,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:59,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:59,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:59" (1/1) ... [2019-10-22 09:01:59,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100b9be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:59, skipping insertion in model container [2019-10-22 09:01:59,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:59" (1/1) ... [2019-10-22 09:01:59,831 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:59,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:00,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:00,592 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:00,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:00,748 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:00,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00 WrapperNode [2019-10-22 09:02:00,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:00,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:00,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:00,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:00,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:01,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:01,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:01,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:01,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:01,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:01,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:01,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:01,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:01,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:01,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:01,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:01,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:01,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:01,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:01,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:01,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/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 [2019-10-22 09:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 09:02:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:01,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:11,197 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:11,197 INFO L284 CfgBuilder]: Removed 1577 assume(true) statements. [2019-10-22 09:02:11,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:11 BoogieIcfgContainer [2019-10-22 09:02:11,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:11,201 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:11,201 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:11,203 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:11,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:11,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:59" (1/3) ... [2019-10-22 09:02:11,204 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@172fe2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:11, skipping insertion in model container [2019-10-22 09:02:11,205 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:11,205 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (2/3) ... [2019-10-22 09:02:11,205 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@172fe2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:11, skipping insertion in model container [2019-10-22 09:02:11,205 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:11,205 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:11" (3/3) ... [2019-10-22 09:02:11,207 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product24.cil.c [2019-10-22 09:02:11,247 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:11,247 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:11,247 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:11,247 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:11,247 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:11,248 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:11,248 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:11,248 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:11,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6906 states. [2019-10-22 09:02:11,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3413 [2019-10-22 09:02:11,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:11,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:11,499 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:11,500 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:11,500 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:11,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6906 states. [2019-10-22 09:02:11,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3413 [2019-10-22 09:02:11,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:11,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:11,582 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:11,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:11,589 INFO L791 eck$LassoCheckResult]: Stem: 1588#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(10);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string111.base, #t~string111.offset, 1);call write~init~int(95, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(93, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string113.base, #t~string113.offset, 1);call write~init~int(93, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(32, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 3 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(97, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(116, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(32, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 4 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string117.base, #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 2 + #t~string117.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(10);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string121.base, #t~string121.offset, 1);call write~init~int(112, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 2 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string123.base, #t~string123.offset, 1);call write~init~int(111, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(119, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(110, #t~string123.base, 3 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 4 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(73, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(76, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(95, #t~string125.base, 3 + #t~string125.offset, 1);call write~init~int(112, #t~string125.base, 4 + #t~string125.offset, 1);call write~init~int(58, #t~string125.base, 5 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 6 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(37, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(105, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 3 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(37, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 3 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string135.base, #t~string135.offset, 1);call write~init~int(37, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(105, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 3 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(70, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(95, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(112, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(58, #t~string137.base, 4 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 5 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string146.base, #t~string146.offset, 1);call write~init~int(37, #t~string146.base, 1 + #t~string146.offset, 1);call write~init~int(105, #t~string146.base, 2 + #t~string146.offset, 1);call write~init~int(0, #t~string146.base, 3 + #t~string146.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(37, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(105, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 3 + #t~string149.offset, 1);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string152.base, #t~string152.offset, 1);call write~init~int(37, #t~string152.base, 1 + #t~string152.offset, 1);call write~init~int(105, #t~string152.base, 2 + #t~string152.offset, 1);call write~init~int(0, #t~string152.base, 3 + #t~string152.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string154.base, #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 1 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 5834#L-1true havoc main_#res;havoc main_#t~ret48, main_~retValue_acc~4, main_~tmp~11;havoc main_~retValue_acc~4;havoc main_~tmp~11; 5995#L3523true havoc valid_product_#res;havoc valid_product_~retValue_acc~31;havoc valid_product_~retValue_acc~31;valid_product_~retValue_acc~31 := 1;valid_product_#res := valid_product_~retValue_acc~31; 6893#L3531true main_#t~ret48 := valid_product_#res;main_~tmp~11 := main_#t~ret48;havoc main_#t~ret48; 997#L764true assume 0 != main_~tmp~11; 5262#L733true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 5207#L3203true havoc bigMacCall_#t~ret41, bigMacCall_~tmp~8;havoc bigMacCall_~tmp~8;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 444#L3426true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 2303#L3451true bigMacCall_#t~ret41 := getOrigin_#res;bigMacCall_~tmp~8 := bigMacCall_#t~ret41;havoc bigMacCall_#t~ret41;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~8;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 2250#L1142true assume 0 == initPersonOnFloor_~floor; 2191#L1143true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6367#L1250-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 5024#L3210true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 1335#L3222-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 247#L946-2true havoc angelinaCall_#t~ret38, angelinaCall_~tmp~5;havoc angelinaCall_~tmp~5;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 445#L3426-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 2302#L3451-1true angelinaCall_#t~ret38 := getOrigin_#res;angelinaCall_~tmp~5 := angelinaCall_#t~ret38;havoc angelinaCall_#t~ret38;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 2251#L1142-1true assume 0 == initPersonOnFloor_~floor; 2192#L1143-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6371#L1250-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 934#L3210-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 1340#L3222-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 228#L946-5true havoc cleanup_#t~ret42, cleanup_#t~ret43, cleanup_~i~0, cleanup_~tmp~9, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~2;havoc cleanup_~i~0;havoc cleanup_~tmp~9;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret108, timeShift_~tmp~25;havoc timeShift_~tmp~25;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1598#L1693true timeShift_#t~ret108 := areDoorsOpen_#res;timeShift_~tmp~25 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 278#L2704true assume 0 != timeShift_~tmp~25; 314#L2705true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 999#L2349-11true havoc __utac_acc__Specification1_spec__3_#t~ret166, __utac_acc__Specification1_spec__3_#t~ret167, __utac_acc__Specification1_spec__3_#t~ret168, __utac_acc__Specification1_spec__3_#t~ret169, __utac_acc__Specification1_spec__3_#t~ret170, __utac_acc__Specification1_spec__3_#t~ret171, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~30, __utac_acc__Specification1_spec__3_~tmp___0~13, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~30;havoc __utac_acc__Specification1_spec__3_~tmp___0~13;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 2384#L1684-10true __utac_acc__Specification1_spec__3_#t~ret166 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~30 := __utac_acc__Specification1_spec__3_#t~ret166;havoc __utac_acc__Specification1_spec__3_#t~ret166;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~30; 561#L3248true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 457#L3249true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1599#L1693-1true __utac_acc__Specification1_spec__3_#t~ret167 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret167;havoc __utac_acc__Specification1_spec__3_#t~ret167; 430#L3253true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 3671#L3308true cleanup_~i~0 := 0; 5098#L563-2true [2019-10-22 09:02:11,595 INFO L793 eck$LassoCheckResult]: Loop: 5098#L563-2true assume !false; 5163#L564true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 5043#L567true assume cleanup_~i~0 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 1800#L1531true cleanup_#t~ret42 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret42;havoc cleanup_#t~ret42; 857#L571true assume 1 != cleanup_~tmp___0~0; 858#L571-1true havoc isIdle_#res;havoc isIdle_#t~ret56, isIdle_~retValue_acc~15, isIdle_~tmp~15;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~15;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_#t~ret55, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~14, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~14;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~5;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~5; 3385#L866-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~5 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~5; 6387#L893-130true anyStopRequested_#t~ret51 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret51;havoc anyStopRequested_#t~ret51; 5270#L1792true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 2475#L1856true isIdle_#t~ret56 := anyStopRequested_#res;isIdle_~tmp~15 := isIdle_#t~ret56;havoc isIdle_#t~ret56;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~15 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 1602#L1869true cleanup_#t~ret43 := isIdle_#res;cleanup_~tmp~9 := cleanup_#t~ret43;havoc cleanup_#t~ret43; 1289#L583true assume !(0 != cleanup_~tmp~9);havoc timeShift_#t~ret108, timeShift_~tmp~25;havoc timeShift_~tmp~25;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1595#L1693-6true timeShift_#t~ret108 := areDoorsOpen_#res;timeShift_~tmp~25 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 277#L2704-1true assume 0 != timeShift_~tmp~25; 315#L2705-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 996#L2349-23true havoc __utac_acc__Specification1_spec__3_#t~ret166, __utac_acc__Specification1_spec__3_#t~ret167, __utac_acc__Specification1_spec__3_#t~ret168, __utac_acc__Specification1_spec__3_#t~ret169, __utac_acc__Specification1_spec__3_#t~ret170, __utac_acc__Specification1_spec__3_#t~ret171, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~30, __utac_acc__Specification1_spec__3_~tmp___0~13, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~30;havoc __utac_acc__Specification1_spec__3_~tmp___0~13;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 2364#L1684-21true __utac_acc__Specification1_spec__3_#t~ret166 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~30 := __utac_acc__Specification1_spec__3_#t~ret166;havoc __utac_acc__Specification1_spec__3_#t~ret166;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~30; 563#L3248-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 455#L3249-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1596#L1693-7true __utac_acc__Specification1_spec__3_#t~ret167 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret167;havoc __utac_acc__Specification1_spec__3_#t~ret167; 421#L3253-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 3673#L3308-1true cleanup_~i~0 := 1 + cleanup_~i~0; 5098#L563-2true [2019-10-22 09:02:11,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1234750710, now seen corresponding path program 1 times [2019-10-22 09:02:11,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:11,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754773101] [2019-10-22 09:02:11,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:11,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:11,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:11,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754773101] [2019-10-22 09:02:11,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:11,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:11,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724409472] [2019-10-22 09:02:11,894 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash -316262643, now seen corresponding path program 1 times [2019-10-22 09:02:11,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:11,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395045964] [2019-10-22 09:02:11,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:11,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:11,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:11,951 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:12,153 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-10-22 09:02:12,391 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-22 09:02:12,401 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:12,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:12,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:12,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:12,403 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:12,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:12,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:12,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product24.cil.c_Iteration1_Loop [2019-10-22 09:02:12,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:12,404 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:12,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:12,839 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:12,840 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:12,858 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,858 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret56=0} Honda state: {ULTIMATE.start_isIdle_#t~ret56=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:02:12,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,877 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,891 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:12,892 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~9=0, ULTIMATE.start_isIdle_~retValue_acc~15=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~9=0, ULTIMATE.start_isIdle_~retValue_acc~15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:12,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:12,932 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e8c523e-7540-4488-895e-a79d79cd0dfe/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:13,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:13,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:25,064 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-10-22 09:02:25,066 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:25,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:25,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:25,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:25,066 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:25,066 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:25,066 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:25,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:25,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product24.cil.c_Iteration1_Loop [2019-10-22 09:02:25,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:25,067 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:25,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:25,546 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:25,550 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:25,552 INFO L120 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 [2019-10-22 09:02:25,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,554 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,554 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,557 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,559 INFO L120 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 [2019-10-22 09:02:25,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,559 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,560 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,560 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,561 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,561 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,563 INFO L120 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 [2019-10-22 09:02:25,563 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,563 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,564 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:25,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,565 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:25,565 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,579 INFO L120 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 [2019-10-22 09:02:25,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,580 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:25,581 INFO L120 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 [2019-10-22 09:02:25,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:25,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:25,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:25,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:25,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:25,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:25,584 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:25,588 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:25,593 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:25,593 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:25,595 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:25,595 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:25,595 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:25,596 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2019-10-22 09:02:25,599 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:25,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:25,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:25,847 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:02:25,848 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6906 states. Second operand 5 states. [2019-10-22 09:02:26,641 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6906 states.. Second operand 5 states. Result 10379 states and 19557 transitions. Complement of second has 9 states. [2019-10-22 09:02:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13082 transitions. [2019-10-22 09:02:26,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13082 transitions. Stem has 33 letters. Loop has 22 letters. [2019-10-22 09:02:26,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:26,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13082 transitions. Stem has 55 letters. Loop has 22 letters. [2019-10-22 09:02:26,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:26,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13082 transitions. Stem has 33 letters. Loop has 44 letters. [2019-10-22 09:02:26,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:26,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10379 states and 19557 transitions. [2019-10-22 09:02:26,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:26,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10379 states to 0 states and 0 transitions. [2019-10-22 09:02:26,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:26,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:26,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:26,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:26,753 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:26,753 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:26,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:26,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:26,757 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 09:02:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:26,760 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 09:02:26,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:02:26,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 09:02:26,761 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:26,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:02:26,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:26,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:26,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:26,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:26,761 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:26,761 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:26,762 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:26,762 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:26,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:26,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:26,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:26,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:26 BoogieIcfgContainer [2019-10-22 09:02:26,768 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:26,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:26,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:26,768 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:26,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:11" (3/4) ... [2019-10-22 09:02:26,772 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:26,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:26,773 INFO L168 Benchmark]: Toolchain (without parser) took 26956.12 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 642.3 MB). Free memory was 935.5 MB in the beginning and 1.3 GB in the end (delta: -400.4 MB). Peak memory consumption was 241.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,773 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:26,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 931.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -115.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 340.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.3 MB in the end (delta: 74.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,774 INFO L168 Benchmark]: Boogie Preprocessor took 403.43 ms. Allocated memory is still 1.1 GB. Free memory was 976.3 MB in the beginning and 907.2 MB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,775 INFO L168 Benchmark]: RCFGBuilder took 9706.28 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 535.3 MB). Free memory was 907.2 MB in the beginning and 1.3 GB in the end (delta: -389.5 MB). Peak memory consumption was 439.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:26,776 INFO L168 Benchmark]: BuchiAutomizer took 15567.03 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 1.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -39.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:26,776 INFO L168 Benchmark]: Witness Printer took 3.74 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:26,778 INFO L335 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 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 931.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -115.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 340.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.3 MB in the end (delta: 74.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 403.43 ms. Allocated memory is still 1.1 GB. Free memory was 976.3 MB in the beginning and 907.2 MB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9706.28 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 535.3 MB). Free memory was 907.2 MB in the beginning and 1.3 GB in the end (delta: -389.5 MB). Peak memory consumption was 439.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15567.03 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 1.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -39.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.74 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 14.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13048 SDtfs, 19490 SDslu, 6483 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...