./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/nec11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/nec11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5edcfc0376a9e6be0c706a9b358eb1360b076159 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-5485861 [2020-10-26 04:47:17,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:47:17,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:47:18,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:47:18,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:47:18,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:47:18,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:47:18,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:47:18,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:47:18,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:47:18,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:47:18,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:47:18,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:47:18,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:47:18,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:47:18,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:47:18,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:47:18,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:47:18,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:47:18,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:47:18,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:47:18,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:47:18,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:47:18,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:47:18,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:47:18,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:47:18,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:47:18,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:47:18,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:47:18,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:47:18,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:47:18,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:47:18,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:47:18,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:47:18,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:47:18,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:47:18,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:47:18,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:47:18,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:47:18,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:47:18,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:47:18,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 04:47:18,207 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:47:18,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:47:18,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:47:18,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:47:18,210 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:47:18,210 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:47:18,210 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:47:18,210 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:47:18,211 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:47:18,211 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:47:18,211 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:47:18,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:47:18,212 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:47:18,212 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:47:18,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:47:18,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:47:18,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:47:18,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:47:18,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:47:18,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:47:18,214 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:47:18,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:47:18,215 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:47:18,215 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:47:18,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:47:18,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:47:18,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:47:18,217 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:47:18,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:47:18,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:47:18,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:47:18,218 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:47:18,219 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:47:18,220 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> 5edcfc0376a9e6be0c706a9b358eb1360b076159 [2020-10-26 04:47:18,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:47:18,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:47:18,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:47:18,648 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:47:18,649 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:47:18,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/nec11.c [2020-10-26 04:47:18,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc97fb90f/4e90584f8ea447fbb244986ca54a73e0/FLAGd4251c83d [2020-10-26 04:47:19,299 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:47:19,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c [2020-10-26 04:47:19,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc97fb90f/4e90584f8ea447fbb244986ca54a73e0/FLAGd4251c83d [2020-10-26 04:47:19,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc97fb90f/4e90584f8ea447fbb244986ca54a73e0 [2020-10-26 04:47:19,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:47:19,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:47:19,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:47:19,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:47:19,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:47:19,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:19,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e190ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19, skipping insertion in model container [2020-10-26 04:47:19,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:19,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:47:19,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:47:19,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:47:19,955 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:47:19,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:47:19,992 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:47:19,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19 WrapperNode [2020-10-26 04:47:19,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:47:19,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:47:19,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:47:19,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:47:20,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:47:20,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:47:20,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:47:20,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:47:20,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... [2020-10-26 04:47:20,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:47:20,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:47:20,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:47:20,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:47:20,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:47:20,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:47:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:47:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:47:20,418 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:47:20,418 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-26 04:47:20,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:47:20 BoogieIcfgContainer [2020-10-26 04:47:20,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:47:20,422 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:47:20,423 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:47:20,428 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:47:20,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:47:20,430 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:47:19" (1/3) ... [2020-10-26 04:47:20,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@556c7c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:47:20, skipping insertion in model container [2020-10-26 04:47:20,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:47:20,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:47:19" (2/3) ... [2020-10-26 04:47:20,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@556c7c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:47:20, skipping insertion in model container [2020-10-26 04:47:20,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:47:20,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:47:20" (3/3) ... [2020-10-26 04:47:20,435 INFO L373 chiAutomizerObserver]: Analyzing ICFG nec11.c [2020-10-26 04:47:20,554 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:47:20,555 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:47:20,555 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:47:20,555 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:47:20,556 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:47:20,556 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:47:20,556 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:47:20,556 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:47:20,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-26 04:47:20,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:47:20,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:20,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:20,609 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:47:20,610 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:47:20,610 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:47:20,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-26 04:47:20,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:47:20,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:20,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:20,613 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:47:20,614 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:47:20,622 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~post8, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0; 6#L21-2true [2020-10-26 04:47:20,623 INFO L796 eck$LassoCheckResult]: Loop: 6#L21-2true assume !!(0 != main_~c~0 % 256); 11#L23true assume !(4 == main_~len~0); 9#L23-2true assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 6#L21-2true [2020-10-26 04:47:20,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:20,630 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:47:20,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:20,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731593289] [2020-10-26 04:47:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,803 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 40876, now seen corresponding path program 1 times [2020-10-26 04:47:20,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:20,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812244840] [2020-10-26 04:47:20,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,828 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash 28699818, now seen corresponding path program 1 times [2020-10-26 04:47:20,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:20,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160485869] [2020-10-26 04:47:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,928 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:21,312 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-10-26 04:47:21,551 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-26 04:47:21,567 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:47:21,568 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:47:21,568 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:47:21,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:47:21,569 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:47:21,569 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:21,569 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:47:21,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:47:21,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: nec11.c_Iteration1_Lasso [2020-10-26 04:47:21,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:47:21,571 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:47:21,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:21,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:22,505 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:47:22,511 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:22,523 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 [2020-10-26 04:47:22,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:22,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:22,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:22,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:22,594 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 [2020-10-26 04:47:22,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:22,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:22,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:22,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:22,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-26 04:47:22,646 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 [2020-10-26 04:47:22,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:22,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:22,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:22,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:22,709 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 [2020-10-26 04:47:22,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:22,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:22,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:22,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:22,767 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 [2020-10-26 04:47:22,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:22,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:22,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:22,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:22,824 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 [2020-10-26 04:47:22,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:22,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:22,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:22,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:22,884 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 [2020-10-26 04:47:22,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:22,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:22,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:22,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:22,934 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 [2020-10-26 04:47:22,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:22,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:22,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:22,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:22,984 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 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:22,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:22,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:22,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:22,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:22,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:22,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:22,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:23,030 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 [2020-10-26 04:47:23,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:23,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,074 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 [2020-10-26 04:47:23,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:23,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:23,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:23,129 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 [2020-10-26 04:47:23,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:23,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,196 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 [2020-10-26 04:47:23,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:23,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:23,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:23,252 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 [2020-10-26 04:47:23,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:23,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:23,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:23,297 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 [2020-10-26 04:47:23,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:23,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:23,346 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 [2020-10-26 04:47:23,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:23,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:23,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,389 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 [2020-10-26 04:47:23,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:23,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:23,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:23,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,418 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 [2020-10-26 04:47:23,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:23,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:23,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:23,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,462 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 [2020-10-26 04:47:23,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:23,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:23,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:23,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:23,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:23,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:23,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:47:23,492 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-26 04:47:23,492 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:23,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:47:23,543 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:47:23,544 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:47:23,545 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~len~0) = -2*ULTIMATE.start_main_~len~0 + 7 Supporting invariants [] [2020-10-26 04:47:23,718 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-26 04:47:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:23,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:23,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:23,794 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:47:23,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:23,841 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:47:23,843 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2020-10-26 04:47:23,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 8 states. [2020-10-26 04:47:23,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:47:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 04:47:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-10-26 04:47:23,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2020-10-26 04:47:23,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:23,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-26 04:47:23,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:23,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2020-10-26 04:47:23,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:23,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2020-10-26 04:47:23,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:47:23,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 10 states and 13 transitions. [2020-10-26 04:47:23,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-26 04:47:23,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-26 04:47:23,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-10-26 04:47:23,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:23,935 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-26 04:47:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-10-26 04:47:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-10-26 04:47:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-26 04:47:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-10-26 04:47:23,967 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-26 04:47:23,968 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-10-26 04:47:23,968 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:47:23,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-10-26 04:47:23,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:47:23,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:23,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:23,969 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:47:23,969 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:47:23,969 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 125#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~post8, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0; 126#L21-2 assume !!(0 != main_~c~0 % 256); 132#L23 assume 4 == main_~len~0;main_~len~0 := 0; 127#L23-2 [2020-10-26 04:47:23,970 INFO L796 eck$LassoCheckResult]: Loop: 127#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 128#L21-2 assume !!(0 != main_~c~0 % 256); 134#L23 assume !(4 == main_~len~0); 127#L23-2 [2020-10-26 04:47:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2020-10-26 04:47:23,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:23,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879499026] [2020-10-26 04:47:23,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:24,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879499026] [2020-10-26 04:47:24,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:47:24,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:47:24,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323573211] [2020-10-26 04:47:24,033 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash 47446, now seen corresponding path program 2 times [2020-10-26 04:47:24,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:24,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195667855] [2020-10-26 04:47:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:24,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:24,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:24,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:24,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:47:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:47:24,166 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-26 04:47:24,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:24,185 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-10-26 04:47:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:47:24,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2020-10-26 04:47:24,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:47:24,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2020-10-26 04:47:24,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-26 04:47:24,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-26 04:47:24,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-10-26 04:47:24,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:24,189 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-26 04:47:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-10-26 04:47:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2020-10-26 04:47:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-26 04:47:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-10-26 04:47:24,191 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-10-26 04:47:24,191 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-10-26 04:47:24,191 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:47:24,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-10-26 04:47:24,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-26 04:47:24,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:24,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:24,199 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-10-26 04:47:24,199 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:47:24,199 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 155#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~post8, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0; 156#L21-2 assume !!(0 != main_~c~0 % 256); 163#L23 assume !(4 == main_~len~0); 159#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 160#L21-2 assume !!(0 != main_~c~0 % 256); 162#L23 assume 4 == main_~len~0;main_~len~0 := 0; 157#L23-2 [2020-10-26 04:47:24,199 INFO L796 eck$LassoCheckResult]: Loop: 157#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 158#L21-2 assume !!(0 != main_~c~0 % 256); 164#L23 assume !(4 == main_~len~0); 157#L23-2 [2020-10-26 04:47:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:24,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1810721677, now seen corresponding path program 1 times [2020-10-26 04:47:24,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:24,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070207993] [2020-10-26 04:47:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:24,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070207993] [2020-10-26 04:47:24,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289748092] [2020-10-26 04:47:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:24,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 04:47:24,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:24,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:24,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-10-26 04:47:24,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856129213] [2020-10-26 04:47:24,339 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:24,339 INFO L82 PathProgramCache]: Analyzing trace with hash 47446, now seen corresponding path program 3 times [2020-10-26 04:47:24,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:24,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402492375] [2020-10-26 04:47:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:24,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:24,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:24,365 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:24,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:47:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:47:24,409 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-10-26 04:47:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:24,444 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-10-26 04:47:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:47:24,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-10-26 04:47:24,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 04:47:24,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2020-10-26 04:47:24,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-26 04:47:24,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-26 04:47:24,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-10-26 04:47:24,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:24,450 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-26 04:47:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-10-26 04:47:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2020-10-26 04:47:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-26 04:47:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-10-26 04:47:24,454 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-26 04:47:24,454 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-26 04:47:24,454 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:47:24,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-10-26 04:47:24,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-26 04:47:24,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:24,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:24,457 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2020-10-26 04:47:24,457 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-10-26 04:47:24,458 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 211#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~post8, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0; 212#L21-2 assume !!(0 != main_~c~0 % 256); 223#L23 assume !(4 == main_~len~0); 226#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 222#L21-2 assume !!(0 != main_~c~0 % 256); 220#L23 assume !(4 == main_~len~0); 215#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 216#L21-2 assume !!(0 != main_~c~0 % 256); 218#L23 assume 4 == main_~len~0;main_~len~0 := 0; 219#L23-2 [2020-10-26 04:47:24,458 INFO L796 eck$LassoCheckResult]: Loop: 219#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 225#L21-2 assume !!(0 != main_~c~0 % 256); 224#L23 assume !(4 == main_~len~0); 213#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 214#L21-2 assume !!(0 != main_~c~0 % 256); 221#L23 assume 4 == main_~len~0;main_~len~0 := 0; 219#L23-2 [2020-10-26 04:47:24,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:24,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1579681018, now seen corresponding path program 2 times [2020-10-26 04:47:24,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:24,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178426810] [2020-10-26 04:47:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:24,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178426810] [2020-10-26 04:47:24,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497983860] [2020-10-26 04:47:24,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:24,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:47:24,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:47:24,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:47:24,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:24,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:24,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-26 04:47:24,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4383689] [2020-10-26 04:47:24,610 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1413481439, now seen corresponding path program 1 times [2020-10-26 04:47:24,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:24,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553531221] [2020-10-26 04:47:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:24,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:24,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:24,628 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:24,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:24,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:47:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:47:24,702 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-10-26 04:47:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:24,727 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-10-26 04:47:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:47:24,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-10-26 04:47:24,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-10-26 04:47:24,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 27 transitions. [2020-10-26 04:47:24,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 04:47:24,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 04:47:24,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-10-26 04:47:24,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:24,731 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-10-26 04:47:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-10-26 04:47:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-10-26 04:47:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 04:47:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-10-26 04:47:24,735 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-26 04:47:24,735 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-26 04:47:24,735 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:47:24,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-10-26 04:47:24,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-26 04:47:24,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:24,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:24,737 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2020-10-26 04:47:24,737 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2020-10-26 04:47:24,737 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 289#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~post8, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0; 290#L21-2 assume !!(0 != main_~c~0 % 256); 301#L23 assume !(4 == main_~len~0); 310#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 309#L21-2 assume !!(0 != main_~c~0 % 256); 297#L23 assume !(4 == main_~len~0); 293#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 294#L21-2 assume !!(0 != main_~c~0 % 256); 300#L23 assume !(4 == main_~len~0); 306#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 305#L21-2 assume !!(0 != main_~c~0 % 256); 296#L23 assume 4 == main_~len~0;main_~len~0 := 0; 291#L23-2 [2020-10-26 04:47:24,737 INFO L796 eck$LassoCheckResult]: Loop: 291#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 292#L21-2 assume !!(0 != main_~c~0 % 256); 304#L23 assume !(4 == main_~len~0); 307#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 308#L21-2 assume !!(0 != main_~c~0 % 256); 302#L23 assume !(4 == main_~len~0); 303#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 298#L21-2 assume !!(0 != main_~c~0 % 256); 299#L23 assume 4 == main_~len~0;main_~len~0 := 0; 291#L23-2 [2020-10-26 04:47:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash -320467731, now seen corresponding path program 3 times [2020-10-26 04:47:24,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:24,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743008348] [2020-10-26 04:47:24,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:24,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743008348] [2020-10-26 04:47:24,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972237226] [2020-10-26 04:47:24,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:24,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-26 04:47:24,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:47:24,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:47:24,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:24,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:24,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-26 04:47:24,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27507075] [2020-10-26 04:47:24,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1166256500, now seen corresponding path program 2 times [2020-10-26 04:47:24,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:24,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335346088] [2020-10-26 04:47:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:24,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:24,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:24,885 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:24,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:24,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:47:24,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:47:24,992 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-10-26 04:47:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:25,024 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-10-26 04:47:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:47:25,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2020-10-26 04:47:25,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-26 04:47:25,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 33 transitions. [2020-10-26 04:47:25,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-26 04:47:25,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 04:47:25,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2020-10-26 04:47:25,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:25,029 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-10-26 04:47:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2020-10-26 04:47:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-10-26 04:47:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-26 04:47:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-10-26 04:47:25,038 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-10-26 04:47:25,038 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-10-26 04:47:25,038 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:47:25,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2020-10-26 04:47:25,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-26 04:47:25,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:25,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:25,041 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2020-10-26 04:47:25,041 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2020-10-26 04:47:25,042 INFO L794 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 389#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~post8, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0; 390#L21-2 assume !!(0 != main_~c~0 % 256); 401#L23 assume !(4 == main_~len~0); 416#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 400#L21-2 assume !!(0 != main_~c~0 % 256); 397#L23 assume !(4 == main_~len~0); 393#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 394#L21-2 assume !!(0 != main_~c~0 % 256); 415#L23 assume !(4 == main_~len~0); 414#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 413#L21-2 assume !!(0 != main_~c~0 % 256); 408#L23 assume !(4 == main_~len~0); 409#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 407#L21-2 assume !!(0 != main_~c~0 % 256); 396#L23 assume 4 == main_~len~0;main_~len~0 := 0; 391#L23-2 [2020-10-26 04:47:25,042 INFO L796 eck$LassoCheckResult]: Loop: 391#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 392#L21-2 assume !!(0 != main_~c~0 % 256); 402#L23 assume !(4 == main_~len~0); 403#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 405#L21-2 assume !!(0 != main_~c~0 % 256); 406#L23 assume !(4 == main_~len~0); 412#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 411#L21-2 assume !!(0 != main_~c~0 % 256); 410#L23 assume !(4 == main_~len~0); 404#L23-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post8 := main_~len~0;main_~len~0 := 1 + main_#t~post8;havoc main_#t~post8; 398#L21-2 assume !!(0 != main_~c~0 % 256); 399#L23 assume 4 == main_~len~0;main_~len~0 := 0; 391#L23-2 [2020-10-26 04:47:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash 658202022, now seen corresponding path program 4 times [2020-10-26 04:47:25,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:25,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12078199] [2020-10-26 04:47:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:25,074 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:25,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:25,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:25,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1957011391, now seen corresponding path program 3 times [2020-10-26 04:47:25,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:25,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596549591] [2020-10-26 04:47:25,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:25,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:25,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:25,114 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash -282022428, now seen corresponding path program 5 times [2020-10-26 04:47:25,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:25,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399007365] [2020-10-26 04:47:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:25,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:25,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:25,173 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:25,319 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-26 04:47:25,874 WARN L193 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2020-10-26 04:47:25,959 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2020-10-26 04:47:25,962 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:47:26,065 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-26 04:47:26,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:26,067 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:47:26,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:128, output treesize:133 [2020-10-26 04:47:26,176 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-26 04:47:26,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:47:26 BoogieIcfgContainer [2020-10-26 04:47:26,247 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:47:26,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:47:26,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:47:26,248 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:47:26,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:47:20" (3/4) ... [2020-10-26 04:47:26,253 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 04:47:26,338 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 04:47:26,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:47:26,343 INFO L168 Benchmark]: Toolchain (without parser) took 6655.59 ms. Allocated memory was 44.0 MB in the beginning and 83.9 MB in the end (delta: 39.8 MB). Free memory was 20.9 MB in the beginning and 19.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 43.5 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:26,344 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 44.0 MB. Free memory is still 28.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:47:26,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.42 ms. Allocated memory is still 44.0 MB. Free memory was 20.3 MB in the beginning and 22.6 MB in the end (delta: -2.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:26,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.96 ms. Allocated memory is still 44.0 MB. Free memory was 22.4 MB in the beginning and 21.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:47:26,345 INFO L168 Benchmark]: Boogie Preprocessor took 26.07 ms. Allocated memory is still 44.0 MB. Free memory was 21.2 MB in the beginning and 20.2 MB in the end (delta: 977.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:26,348 INFO L168 Benchmark]: RCFGBuilder took 356.44 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 20.0 MB in the beginning and 31.9 MB in the end (delta: -11.9 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:26,349 INFO L168 Benchmark]: BuchiAutomizer took 5824.93 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 31.7 MB in the beginning and 21.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:26,351 INFO L168 Benchmark]: Witness Printer took 94.00 ms. Allocated memory is still 83.9 MB. Free memory was 21.1 MB in the beginning and 19.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:26,356 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 44.0 MB. Free memory is still 28.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 292.42 ms. Allocated memory is still 44.0 MB. Free memory was 20.3 MB in the beginning and 22.6 MB in the end (delta: -2.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.96 ms. Allocated memory is still 44.0 MB. Free memory was 22.4 MB in the beginning and 21.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.07 ms. Allocated memory is still 44.0 MB. Free memory was 21.2 MB in the beginning and 20.2 MB in the end (delta: 977.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 356.44 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 20.0 MB in the beginning and 31.9 MB in the end (delta: -11.9 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5824.93 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 31.7 MB in the beginning and 21.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB. * Witness Printer took 94.00 ms. Allocated memory is still 83.9 MB. Free memory was 21.1 MB in the beginning and 19.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * len + 7 and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 6 iterations. TraceHistogramMax:5. Analysis of lassos took 5.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 19 SDslu, 35 SDs, 0 SdLazy, 40 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU4 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital135 mio100 ax100 hnf100 lsp68 ukn47 mio100 lsp43 div236 bol100 ite100 ukn100 eq144 hnf49 smp78 dnf100 smp100 tf100 neg95 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=10801} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=10802, NULL=0, \result=0, NULL=10804, c=257, NULL=10801, i=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3cd31763=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@10aac410=0, NULL=0, len=0, NULL=10803} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 23]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int a[5]; [L16] int len=0; [L17] _Bool c=__VERIFIER_nondet_bool(); [L18] int i; [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND TRUE len==4 [L24] len =0 Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...