./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/n.c11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/n.c11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/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 f82cf7726c8201fc884c9fdb36548fce0440ab7f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 11:12:12,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:12:12,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:12:13,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:12:13,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:12:13,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:12:13,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:12:13,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:12:13,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:12:13,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:12:13,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:12:13,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:12:13,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:12:13,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:12:13,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:12:13,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:12:13,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:12:13,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:12:13,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:12:13,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:12:13,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:12:13,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:12:13,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:12:13,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:12:13,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:12:13,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:12:13,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:12:13,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:12:13,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:12:13,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:12:13,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:12:13,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:12:13,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:12:13,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:12:13,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:12:13,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:12:13,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:12:13,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:12:13,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:12:13,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:12:13,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:12:13,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 11:12:13,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:12:13,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:12:13,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:12:13,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:12:13,088 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:12:13,088 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 11:12:13,089 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 11:12:13,089 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 11:12:13,089 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 11:12:13,089 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 11:12:13,089 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 11:12:13,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:12:13,090 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:12:13,090 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:12:13,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:12:13,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:12:13,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:12:13,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 11:12:13,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 11:12:13,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 11:12:13,091 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:12:13,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:12:13,092 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 11:12:13,092 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:12:13,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 11:12:13,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:12:13,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:12:13,093 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 11:12:13,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:12:13,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:12:13,093 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 11:12:13,094 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 11:12:13,094 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/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/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 -> f82cf7726c8201fc884c9fdb36548fce0440ab7f [2019-11-20 11:12:13,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:12:13,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:12:13,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:12:13,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:12:13,260 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:12:13,261 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/../../sv-benchmarks/c/loops/n.c11.c [2019-11-20 11:12:13,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/data/9e6fa70e8/fe02462513c249ff8716bf93b8df49b1/FLAGb2efd6155 [2019-11-20 11:12:13,687 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:12:13,688 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/sv-benchmarks/c/loops/n.c11.c [2019-11-20 11:12:13,694 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/data/9e6fa70e8/fe02462513c249ff8716bf93b8df49b1/FLAGb2efd6155 [2019-11-20 11:12:14,040 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/data/9e6fa70e8/fe02462513c249ff8716bf93b8df49b1 [2019-11-20 11:12:14,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:12:14,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:12:14,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:12:14,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:12:14,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:12:14,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b60573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14, skipping insertion in model container [2019-11-20 11:12:14,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,060 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:12:14,076 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:12:14,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:12:14,232 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:12:14,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:12:14,336 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:12:14,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14 WrapperNode [2019-11-20 11:12:14,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:12:14,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:12:14,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:12:14,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:12:14,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:12:14,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:12:14,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:12:14,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:12:14,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... [2019-11-20 11:12:14,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:12:14,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:12:14,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:12:14,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:12:14,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/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-11-20 11:12:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:12:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:12:14,702 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:12:14,703 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 11:12:14,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:12:14 BoogieIcfgContainer [2019-11-20 11:12:14,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:12:14,705 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 11:12:14,705 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 11:12:14,712 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 11:12:14,713 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:12:14,714 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 11:12:14" (1/3) ... [2019-11-20 11:12:14,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56fb0f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:12:14, skipping insertion in model container [2019-11-20 11:12:14,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:12:14,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:14" (2/3) ... [2019-11-20 11:12:14,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56fb0f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:12:14, skipping insertion in model container [2019-11-20 11:12:14,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:12:14,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:12:14" (3/3) ... [2019-11-20 11:12:14,721 INFO L371 chiAutomizerObserver]: Analyzing ICFG n.c11.c [2019-11-20 11:12:14,803 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 11:12:14,803 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 11:12:14,804 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 11:12:14,806 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:12:14,806 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:12:14,806 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 11:12:14,807 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:12:14,807 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 11:12:14,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-20 11:12:14,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:12:14,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:12:14,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:12:14,869 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 11:12:14,869 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:12:14,870 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 11:12:14,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-20 11:12:14,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:12:14,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:12:14,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:12:14,873 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 11:12:14,874 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:12:14,883 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 7#L19-2true [2019-11-20 11:12:14,884 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 3#L21true assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 11#L21-2true assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L19-2true [2019-11-20 11:12:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-20 11:12:14,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:14,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056989381] [2019-11-20 11:12:14,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:15,021 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2019-11-20 11:12:15,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:15,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362985272] [2019-11-20 11:12:15,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2019-11-20 11:12:15,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:15,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180167371] [2019-11-20 11:12:15,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:12:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:12:15,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180167371] [2019-11-20 11:12:15,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:12:15,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:12:15,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963843954] [2019-11-20 11:12:15,350 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-20 11:12:15,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:12:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:12:15,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:12:15,386 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-11-20 11:12:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:12:15,421 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-20 11:12:15,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:12:15,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-20 11:12:15,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:12:15,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2019-11-20 11:12:15,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-20 11:12:15,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-20 11:12:15,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-20 11:12:15,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:12:15,432 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-20 11:12:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-20 11:12:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-11-20 11:12:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-20 11:12:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-20 11:12:15,458 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-20 11:12:15,458 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-20 11:12:15,458 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 11:12:15,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-11-20 11:12:15,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 11:12:15,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:12:15,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:12:15,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 11:12:15,460 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:12:15,460 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 46#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 43#L21 assume !(4 == main_~len~0 % 4294967296); 44#L21-2 [2019-11-20 11:12:15,460 INFO L796 eck$LassoCheckResult]: Loop: 44#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 47#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 48#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 44#L21-2 [2019-11-20 11:12:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:15,461 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-20 11:12:15,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:15,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559693328] [2019-11-20 11:12:15,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,471 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2019-11-20 11:12:15,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:15,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601749960] [2019-11-20 11:12:15,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,500 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:15,501 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2019-11-20 11:12:15,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:15,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819108536] [2019-11-20 11:12:15,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:12:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:12:15,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819108536] [2019-11-20 11:12:15,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545205607] [2019-11-20 11:12:15,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:12:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:12:15,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 11:12:15,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:12:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:12:15,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:12:15,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-11-20 11:12:15,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110561774] [2019-11-20 11:12:15,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:12:15,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:12:15,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:12:15,777 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-20 11:12:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:12:15,813 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-20 11:12:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:12:15,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-20 11:12:15,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 11:12:15,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-20 11:12:15,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 11:12:15,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-20 11:12:15,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-20 11:12:15,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:12:15,817 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-20 11:12:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-20 11:12:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-11-20 11:12:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 11:12:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-20 11:12:15,822 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-20 11:12:15,822 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-20 11:12:15,822 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 11:12:15,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-20 11:12:15,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 11:12:15,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:12:15,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:12:15,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 11:12:15,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-11-20 11:12:15,826 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 87#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 92#L21 assume !(4 == main_~len~0 % 4294967296); 89#L21-2 [2019-11-20 11:12:15,826 INFO L796 eck$LassoCheckResult]: Loop: 89#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 88#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 84#L21 assume !(4 == main_~len~0 % 4294967296); 85#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 91#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 90#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 89#L21-2 [2019-11-20 11:12:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2019-11-20 11:12:15,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:15,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888305044] [2019-11-20 11:12:15,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2019-11-20 11:12:15,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:15,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153007865] [2019-11-20 11:12:15,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:15,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:15,929 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2019-11-20 11:12:15,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:15,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96545589] [2019-11-20 11:12:15,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:12:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:12:16,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96545589] [2019-11-20 11:12:16,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077648061] [2019-11-20 11:12:16,033 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:12:16,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 11:12:16,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:12:16,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 11:12:16,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:12:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:12:16,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:12:16,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-20 11:12:16,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520293972] [2019-11-20 11:12:16,245 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-11-20 11:12:16,414 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-11-20 11:12:16,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:12:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:12:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:12:16,415 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-20 11:12:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:12:16,457 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-20 11:12:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:12:16,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-20 11:12:16,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-20 11:12:16,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-20 11:12:16,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-20 11:12:16,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-20 11:12:16,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-20 11:12:16,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:12:16,460 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-20 11:12:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-20 11:12:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-20 11:12:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-20 11:12:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-20 11:12:16,462 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-20 11:12:16,462 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-20 11:12:16,462 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 11:12:16,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-20 11:12:16,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-20 11:12:16,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:12:16,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:12:16,463 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 11:12:16,463 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-11-20 11:12:16,464 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 144#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 152#L21 assume !(4 == main_~len~0 % 4294967296); 147#L21-2 [2019-11-20 11:12:16,464 INFO L796 eck$LassoCheckResult]: Loop: 147#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 145#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 146#L21 assume !(4 == main_~len~0 % 4294967296); 150#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 151#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 141#L21 assume !(4 == main_~len~0 % 4294967296); 142#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 148#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 147#L21-2 [2019-11-20 11:12:16,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:16,464 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-20 11:12:16,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:16,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030571341] [2019-11-20 11:12:16,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:16,471 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:16,472 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2019-11-20 11:12:16,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:16,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879818009] [2019-11-20 11:12:16,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:16,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2019-11-20 11:12:16,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:16,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948329387] [2019-11-20 11:12:16,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:12:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:12:16,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948329387] [2019-11-20 11:12:16,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279902125] [2019-11-20 11:12:16,632 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:12:16,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 11:12:16,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:12:16,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 11:12:16,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:12:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:12:16,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:12:16,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-20 11:12:16,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615464116] [2019-11-20 11:12:17,590 WARN L191 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-20 11:12:18,754 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-11-20 11:12:18,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:12:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:12:18,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:12:18,755 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-11-20 11:12:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:12:18,823 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-11-20 11:12:18,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:12:18,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-11-20 11:12:18,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-20 11:12:18,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-11-20 11:12:18,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-20 11:12:18,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-20 11:12:18,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-11-20 11:12:18,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:12:18,825 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-20 11:12:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-11-20 11:12:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-20 11:12:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 11:12:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-20 11:12:18,828 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-20 11:12:18,828 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-20 11:12:18,828 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 11:12:18,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-20 11:12:18,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-20 11:12:18,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:12:18,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:12:18,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 11:12:18,830 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-11-20 11:12:18,830 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 217#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 214#L21 assume !(4 == main_~len~0 % 4294967296); 215#L21-2 [2019-11-20 11:12:18,830 INFO L796 eck$LassoCheckResult]: Loop: 215#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 228#L21 assume !(4 == main_~len~0 % 4294967296); 227#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 226#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 225#L21 assume !(4 == main_~len~0 % 4294967296); 224#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 222#L21 assume !(4 == main_~len~0 % 4294967296); 220#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 221#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 219#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 215#L21-2 [2019-11-20 11:12:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2019-11-20 11:12:18,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:18,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797123505] [2019-11-20 11:12:18,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:18,836 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2019-11-20 11:12:18,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:18,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681216853] [2019-11-20 11:12:18,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:18,875 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:12:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2019-11-20 11:12:18,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:12:18,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591261989] [2019-11-20 11:12:18,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:12:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:12:18,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:12:20,556 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-11-20 11:12:22,259 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2019-11-20 11:12:22,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 11:12:22 BoogieIcfgContainer [2019-11-20 11:12:22,298 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 11:12:22,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:12:22,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:12:22,299 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:12:22,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:12:14" (3/4) ... [2019-11-20 11:12:22,302 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-20 11:12:22,349 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a1bac9d7-ba5d-4414-8e00-2a3770907c82/bin/uautomizer/witness.graphml [2019-11-20 11:12:22,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:12:22,351 INFO L168 Benchmark]: Toolchain (without parser) took 8307.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 950.1 MB in the beginning and 880.8 MB in the end (delta: 69.4 MB). Peak memory consumption was 184.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:12:22,351 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:12:22,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-20 11:12:22,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:12:22,353 INFO L168 Benchmark]: Boogie Preprocessor took 29.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:12:22,353 INFO L168 Benchmark]: RCFGBuilder took 298.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:12:22,354 INFO L168 Benchmark]: BuchiAutomizer took 7593.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 880.8 MB in the end (delta: 210.4 MB). Peak memory consumption was 210.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:12:22,354 INFO L168 Benchmark]: Witness Printer took 50.77 ms. Allocated memory is still 1.1 GB. Free memory is still 880.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:12:22,357 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 298.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7593.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 880.8 MB in the end (delta: 210.4 MB). Peak memory consumption was 210.4 MB. Max. memory is 11.5 GB. * Witness Printer took 50.77 ms. Allocated memory is still 1.1 GB. Free memory is still 880.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 7.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 18 SDslu, 30 SDs, 0 SdLazy, 84 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 19]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {len=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40395a3c=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@584a21da=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] int a[5]; [L14] unsigned int len=0; [L16] int i; [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) Loop: [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE len==4 [L22] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...