./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_7.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/locks/test_locks_7.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 d2a1f90505878c0035f7701a954d17ca4375eb05 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:29:29,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:29:29,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:29:29,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:29:29,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:29:29,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:29:29,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:29:29,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:29:29,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:29:29,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:29:29,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:29:29,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:29:29,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:29:29,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:29:29,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:29:29,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:29:29,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:29:29,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:29:29,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:29:29,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:29:29,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:29:29,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:29:29,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:29:29,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:29:29,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:29:29,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:29:29,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:29:29,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:29:29,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:29:29,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:29:29,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:29:29,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:29:29,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:29:29,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:29:29,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:29:29,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:29:29,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:29:29,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:29:29,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:29:29,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:29:29,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:29:29,273 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:29:29,332 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:29:29,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:29:29,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:29:29,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:29:29,335 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:29:29,335 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:29:29,335 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:29:29,335 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:29:29,335 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:29:29,335 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:29:29,336 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:29:29,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:29:29,336 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:29:29,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:29:29,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:29:29,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:29:29,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:29:29,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:29:29,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:29:29,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:29:29,338 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:29:29,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:29:29,338 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:29:29,338 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:29:29,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:29:29,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:29:29,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:29:29,339 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:29:29,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:29:29,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:29:29,339 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:29:29,340 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:29:29,341 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:29:29,341 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 -> d2a1f90505878c0035f7701a954d17ca4375eb05 [2020-10-26 04:29:29,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:29:29,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:29:29,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:29:29,764 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:29:29,764 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:29:29,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2020-10-26 04:29:29,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59be4759b/c226fec59fde4858a129f6db34449a7f/FLAG66b8ca26b [2020-10-26 04:29:30,335 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:29:30,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2020-10-26 04:29:30,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59be4759b/c226fec59fde4858a129f6db34449a7f/FLAG66b8ca26b [2020-10-26 04:29:30,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59be4759b/c226fec59fde4858a129f6db34449a7f [2020-10-26 04:29:30,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:29:30,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:29:30,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:29:30,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:29:30,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:29:30,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:29:30" (1/1) ... [2020-10-26 04:29:30,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c82121b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:30, skipping insertion in model container [2020-10-26 04:29:30,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:29:30" (1/1) ... [2020-10-26 04:29:30,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:29:30,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:29:30,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:29:30,971 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:29:30,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:29:31,015 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:29:31,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31 WrapperNode [2020-10-26 04:29:31,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:29:31,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:29:31,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:29:31,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:29:31,027 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:29:31" (1/1) ... [2020-10-26 04:29:31,036 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:29:31" (1/1) ... [2020-10-26 04:29:31,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:29:31,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:29:31,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:29:31,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:29:31,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:29:31,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:29:31,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:29:31,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:29:31,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (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:29:31,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:29:31,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:29:31,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:29:31,554 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:29:31,555 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-26 04:29:31,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:31 BoogieIcfgContainer [2020-10-26 04:29:31,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:29:31,559 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:29:31,559 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:29:31,563 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:29:31,564 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:31,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:29:30" (1/3) ... [2020-10-26 04:29:31,565 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@128df595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:29:31, skipping insertion in model container [2020-10-26 04:29:31,566 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:31,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31" (2/3) ... [2020-10-26 04:29:31,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@128df595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:29:31, skipping insertion in model container [2020-10-26 04:29:31,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:31,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:31" (3/3) ... [2020-10-26 04:29:31,569 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2020-10-26 04:29:31,672 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:29:31,673 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:29:31,673 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:29:31,673 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:29:31,673 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:29:31,673 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:29:31,673 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:29:31,673 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:29:31,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-10-26 04:29:31,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-26 04:29:31,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:31,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:31,730 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:31,730 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:31,731 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:29:31,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-10-26 04:29:31,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-26 04:29:31,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:31,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:31,736 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:31,736 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:31,744 INFO L794 eck$LassoCheckResult]: Stem: 27#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 4#L113-1true [2020-10-26 04:29:31,745 INFO L796 eck$LassoCheckResult]: Loop: 4#L113-1true assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 14#L34true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 26#L53true assume 0 != main_~p1~0;main_~lk1~0 := 1; 8#L53-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 32#L57-1true assume !(0 != main_~p3~0); 22#L61-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 11#L65-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 19#L69-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 6#L73-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 29#L77-1true assume !(0 != main_~p1~0); 23#L83-1true assume !(0 != main_~p2~0); 31#L88-1true assume !(0 != main_~p3~0); 5#L93-1true assume !(0 != main_~p4~0); 12#L98-1true assume !(0 != main_~p5~0); 20#L103-1true assume !(0 != main_~p6~0); 28#L108-1true assume !(0 != main_~p7~0); 4#L113-1true [2020-10-26 04:29:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:29:31,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:31,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311087817] [2020-10-26 04:29:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:31,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:31,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:31,933 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2020-10-26 04:29:31,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:31,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258997492] [2020-10-26 04:29:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:32,067 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:29:32,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258997492] [2020-10-26 04:29:32,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:32,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:32,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246626454] [2020-10-26 04:29:32,083 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:32,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:32,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:32,114 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2020-10-26 04:29:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:32,224 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2020-10-26 04:29:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:32,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 94 transitions. [2020-10-26 04:29:32,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2020-10-26 04:29:32,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 73 transitions. [2020-10-26 04:29:32,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2020-10-26 04:29:32,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2020-10-26 04:29:32,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2020-10-26 04:29:32,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:32,254 INFO L691 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2020-10-26 04:29:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2020-10-26 04:29:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-26 04:29:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-26 04:29:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2020-10-26 04:29:32,308 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2020-10-26 04:29:32,308 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2020-10-26 04:29:32,308 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:29:32,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2020-10-26 04:29:32,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2020-10-26 04:29:32,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:32,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:32,317 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:32,317 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:32,318 INFO L794 eck$LassoCheckResult]: Stem: 126#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 110#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 111#L113-1 [2020-10-26 04:29:32,318 INFO L796 eck$LassoCheckResult]: Loop: 111#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 115#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 116#L53 assume !(0 != main_~p1~0); 134#L53-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 133#L57-1 assume !(0 != main_~p3~0); 121#L61-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 112#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 113#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 104#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 105#L77-1 assume !(0 != main_~p1~0); 122#L83-1 assume !(0 != main_~p2~0); 120#L88-1 assume !(0 != main_~p3~0); 99#L93-1 assume !(0 != main_~p4~0); 100#L98-1 assume !(0 != main_~p5~0); 137#L103-1 assume !(0 != main_~p6~0); 127#L108-1 assume !(0 != main_~p7~0); 111#L113-1 [2020-10-26 04:29:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-26 04:29:32,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687304493] [2020-10-26 04:29:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2020-10-26 04:29:32,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223181994] [2020-10-26 04:29:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:32,465 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:29:32,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223181994] [2020-10-26 04:29:32,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:32,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:32,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395083573] [2020-10-26 04:29:32,469 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:32,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:32,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:32,472 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand 3 states. [2020-10-26 04:29:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:32,519 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2020-10-26 04:29:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:32,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2020-10-26 04:29:32,528 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2020-10-26 04:29:32,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2020-10-26 04:29:32,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-10-26 04:29:32,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-10-26 04:29:32,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2020-10-26 04:29:32,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:32,538 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2020-10-26 04:29:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2020-10-26 04:29:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-10-26 04:29:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-26 04:29:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2020-10-26 04:29:32,555 INFO L714 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2020-10-26 04:29:32,557 INFO L594 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2020-10-26 04:29:32,557 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:29:32,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2020-10-26 04:29:32,559 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2020-10-26 04:29:32,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:32,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:32,560 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:32,560 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:32,560 INFO L794 eck$LassoCheckResult]: Stem: 267#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 253#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 254#L113-1 [2020-10-26 04:29:32,561 INFO L796 eck$LassoCheckResult]: Loop: 254#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 285#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 283#L53 assume !(0 != main_~p1~0); 281#L53-2 assume !(0 != main_~p2~0); 278#L57-1 assume !(0 != main_~p3~0); 263#L61-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 255#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 256#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 245#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 246#L77-1 assume !(0 != main_~p1~0); 310#L83-1 assume !(0 != main_~p2~0); 305#L88-1 assume !(0 != main_~p3~0); 301#L93-1 assume !(0 != main_~p4~0); 298#L98-1 assume !(0 != main_~p5~0); 293#L103-1 assume !(0 != main_~p6~0); 289#L108-1 assume !(0 != main_~p7~0); 254#L113-1 [2020-10-26 04:29:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-26 04:29:32,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985887050] [2020-10-26 04:29:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,629 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2020-10-26 04:29:32,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109059932] [2020-10-26 04:29:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:32,682 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:29:32,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109059932] [2020-10-26 04:29:32,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:32,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:32,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69727904] [2020-10-26 04:29:32,684 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:32,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:32,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:32,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:32,686 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand 3 states. [2020-10-26 04:29:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:32,710 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2020-10-26 04:29:32,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:32,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2020-10-26 04:29:32,714 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2020-10-26 04:29:32,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2020-10-26 04:29:32,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2020-10-26 04:29:32,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2020-10-26 04:29:32,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2020-10-26 04:29:32,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:32,720 INFO L691 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2020-10-26 04:29:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2020-10-26 04:29:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-10-26 04:29:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-26 04:29:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2020-10-26 04:29:32,736 INFO L714 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2020-10-26 04:29:32,736 INFO L594 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2020-10-26 04:29:32,737 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:29:32,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2020-10-26 04:29:32,739 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2020-10-26 04:29:32,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:32,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:32,740 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:32,740 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:32,741 INFO L794 eck$LassoCheckResult]: Stem: 540#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 522#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 523#L113-1 [2020-10-26 04:29:32,741 INFO L796 eck$LassoCheckResult]: Loop: 523#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 567#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 610#L53 assume !(0 != main_~p1~0); 608#L53-2 assume !(0 != main_~p2~0); 607#L57-1 assume !(0 != main_~p3~0); 604#L61-1 assume !(0 != main_~p4~0); 602#L65-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 600#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 598#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 595#L77-1 assume !(0 != main_~p1~0); 596#L83-1 assume !(0 != main_~p2~0); 588#L88-1 assume !(0 != main_~p3~0); 587#L93-1 assume !(0 != main_~p4~0); 578#L98-1 assume !(0 != main_~p5~0); 579#L103-1 assume !(0 != main_~p6~0); 571#L108-1 assume !(0 != main_~p7~0); 523#L113-1 [2020-10-26 04:29:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,741 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-26 04:29:32,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469233331] [2020-10-26 04:29:32,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,767 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:32,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2020-10-26 04:29:32,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163132083] [2020-10-26 04:29:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:32,791 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:29:32,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163132083] [2020-10-26 04:29:32,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:32,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:32,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986691777] [2020-10-26 04:29:32,793 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:32,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:32,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:32,794 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand 3 states. [2020-10-26 04:29:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:32,828 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2020-10-26 04:29:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:32,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2020-10-26 04:29:32,835 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2020-10-26 04:29:32,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2020-10-26 04:29:32,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2020-10-26 04:29:32,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2020-10-26 04:29:32,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2020-10-26 04:29:32,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:32,859 INFO L691 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2020-10-26 04:29:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2020-10-26 04:29:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2020-10-26 04:29:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-10-26 04:29:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2020-10-26 04:29:32,904 INFO L714 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2020-10-26 04:29:32,904 INFO L594 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2020-10-26 04:29:32,906 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:29:32,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2020-10-26 04:29:32,909 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2020-10-26 04:29:32,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:32,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:32,912 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:32,913 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:32,914 INFO L794 eck$LassoCheckResult]: Stem: 1063#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1040#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 1041#L113-1 [2020-10-26 04:29:32,915 INFO L796 eck$LassoCheckResult]: Loop: 1041#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 1118#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 1116#L53 assume !(0 != main_~p1~0); 1112#L53-2 assume !(0 != main_~p2~0); 1110#L57-1 assume !(0 != main_~p3~0); 1106#L61-1 assume !(0 != main_~p4~0); 1103#L65-1 assume !(0 != main_~p5~0); 1101#L69-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1099#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1096#L77-1 assume !(0 != main_~p1~0); 1097#L83-1 assume !(0 != main_~p2~0); 1136#L88-1 assume !(0 != main_~p3~0); 1131#L93-1 assume !(0 != main_~p4~0); 1129#L98-1 assume !(0 != main_~p5~0); 1126#L103-1 assume !(0 != main_~p6~0); 1122#L108-1 assume !(0 != main_~p7~0); 1041#L113-1 [2020-10-26 04:29:32,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-26 04:29:32,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504544195] [2020-10-26 04:29:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,959 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:32,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,960 INFO L82 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2020-10-26 04:29:32,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610563947] [2020-10-26 04:29:32,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:32,991 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:29:32,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610563947] [2020-10-26 04:29:32,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:32,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:32,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870246497] [2020-10-26 04:29:32,993 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:32,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:32,994 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand 3 states. [2020-10-26 04:29:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:33,014 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2020-10-26 04:29:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:33,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2020-10-26 04:29:33,022 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2020-10-26 04:29:33,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2020-10-26 04:29:33,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2020-10-26 04:29:33,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2020-10-26 04:29:33,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2020-10-26 04:29:33,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:33,031 INFO L691 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2020-10-26 04:29:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2020-10-26 04:29:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2020-10-26 04:29:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2020-10-26 04:29:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2020-10-26 04:29:33,052 INFO L714 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2020-10-26 04:29:33,053 INFO L594 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2020-10-26 04:29:33,053 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:29:33,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2020-10-26 04:29:33,068 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2020-10-26 04:29:33,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,069 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,069 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,069 INFO L794 eck$LassoCheckResult]: Stem: 2059#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2042#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 2043#L113-1 [2020-10-26 04:29:33,069 INFO L796 eck$LassoCheckResult]: Loop: 2043#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 2244#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 2239#L53 assume !(0 != main_~p1~0); 2233#L53-2 assume !(0 != main_~p2~0); 2215#L57-1 assume !(0 != main_~p3~0); 2216#L61-1 assume !(0 != main_~p4~0); 2224#L65-1 assume !(0 != main_~p5~0); 2225#L69-1 assume !(0 != main_~p6~0); 2276#L73-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2274#L77-1 assume !(0 != main_~p1~0); 2271#L83-1 assume !(0 != main_~p2~0); 2269#L88-1 assume !(0 != main_~p3~0); 2258#L93-1 assume !(0 != main_~p4~0); 2256#L98-1 assume !(0 != main_~p5~0); 2257#L103-1 assume !(0 != main_~p6~0); 2251#L108-1 assume !(0 != main_~p7~0); 2043#L113-1 [2020-10-26 04:29:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,070 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-26 04:29:33,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911219472] [2020-10-26 04:29:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,090 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2020-10-26 04:29:33,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205805816] [2020-10-26 04:29:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:33,114 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:29:33,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205805816] [2020-10-26 04:29:33,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:33,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:29:33,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577088947] [2020-10-26 04:29:33,116 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:33,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:33,117 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand 3 states. [2020-10-26 04:29:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:33,139 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2020-10-26 04:29:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:33,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2020-10-26 04:29:33,152 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2020-10-26 04:29:33,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2020-10-26 04:29:33,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2020-10-26 04:29:33,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2020-10-26 04:29:33,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2020-10-26 04:29:33,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:33,167 INFO L691 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2020-10-26 04:29:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2020-10-26 04:29:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2020-10-26 04:29:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2020-10-26 04:29:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2020-10-26 04:29:33,212 INFO L714 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2020-10-26 04:29:33,212 INFO L594 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2020-10-26 04:29:33,212 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:29:33,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2020-10-26 04:29:33,222 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2020-10-26 04:29:33,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,223 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,223 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,223 INFO L794 eck$LassoCheckResult]: Stem: 4010#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3988#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;havoc main_~cond~0; 3989#L113-1 [2020-10-26 04:29:33,223 INFO L796 eck$LassoCheckResult]: Loop: 3989#L113-1 assume !false;main_~cond~0 := main_#t~nondet14;havoc main_#t~nondet14; 4298#L34 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0; 4296#L53 assume !(0 != main_~p1~0); 4292#L53-2 assume !(0 != main_~p2~0); 4293#L57-1 assume !(0 != main_~p3~0); 4281#L61-1 assume !(0 != main_~p4~0); 4283#L65-1 assume !(0 != main_~p5~0); 4273#L69-1 assume !(0 != main_~p6~0); 4274#L73-1 assume !(0 != main_~p7~0); 4247#L77-1 assume !(0 != main_~p1~0); 4248#L83-1 assume !(0 != main_~p2~0); 4311#L88-1 assume !(0 != main_~p3~0); 4308#L93-1 assume !(0 != main_~p4~0); 4306#L98-1 assume !(0 != main_~p5~0); 4304#L103-1 assume !(0 != main_~p6~0); 4302#L108-1 assume !(0 != main_~p7~0); 3989#L113-1 [2020-10-26 04:29:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-26 04:29:33,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312105222] [2020-10-26 04:29:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,232 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,242 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2020-10-26 04:29:33,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402222651] [2020-10-26 04:29:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,256 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2020-10-26 04:29:33,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071734969] [2020-10-26 04:29:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,279 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,658 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-10-26 04:29:33,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:29:33 BoogieIcfgContainer [2020-10-26 04:29:33,774 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:29:33,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:29:33,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:29:33,775 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:29:33,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:31" (3/4) ... [2020-10-26 04:29:33,779 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 04:29:33,829 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 04:29:33,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:29:33,832 INFO L168 Benchmark]: Toolchain (without parser) took 3130.94 ms. Allocated memory was 41.9 MB in the beginning and 75.5 MB in the end (delta: 33.6 MB). Free memory was 18.2 MB in the beginning and 33.4 MB in the end (delta: -15.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:33,833 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 41.9 MB. Free memory is still 26.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:29:33,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.88 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 17.6 MB in the beginning and 27.2 MB in the end (delta: -9.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:33,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.46 ms. Allocated memory is still 52.4 MB. Free memory was 27.2 MB in the beginning and 25.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:33,835 INFO L168 Benchmark]: Boogie Preprocessor took 26.73 ms. Allocated memory is still 52.4 MB. Free memory was 25.7 MB in the beginning and 24.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:29:33,835 INFO L168 Benchmark]: RCFGBuilder took 469.25 ms. Allocated memory is still 52.4 MB. Free memory was 24.5 MB in the beginning and 33.8 MB in the end (delta: -9.3 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:33,836 INFO L168 Benchmark]: BuchiAutomizer took 2214.41 ms. Allocated memory was 52.4 MB in the beginning and 75.5 MB in the end (delta: 23.1 MB). Free memory was 33.8 MB in the beginning and 35.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 34.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:33,837 INFO L168 Benchmark]: Witness Printer took 55.85 ms. Allocated memory is still 75.5 MB. Free memory was 35.4 MB in the beginning and 33.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:33,841 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.13 ms. Allocated memory is still 41.9 MB. Free memory is still 26.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 304.88 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 17.6 MB in the beginning and 27.2 MB in the end (delta: -9.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.46 ms. Allocated memory is still 52.4 MB. Free memory was 27.2 MB in the beginning and 25.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.73 ms. Allocated memory is still 52.4 MB. Free memory was 25.7 MB in the beginning and 24.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 469.25 ms. Allocated memory is still 52.4 MB. Free memory was 24.5 MB in the beginning and 33.8 MB in the end (delta: -9.3 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2214.41 ms. Allocated memory was 52.4 MB in the beginning and 75.5 MB in the end (delta: 23.1 MB). Free memory was 33.8 MB in the beginning and 35.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 34.1 MB. Max. memory is 16.1 GB. * Witness Printer took 55.85 ms. Allocated memory is still 75.5 MB. Free memory was 35.4 MB in the beginning and 33.4 MB in the end (delta: 2.0 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1282 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 350 SDtfs, 179 SDslu, 208 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 32]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=18005} State at position 1 is {NULL=18008, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=18005, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@326f4d0d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5700293a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77eed9ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39c025ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@718f10bc=0, cond=11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2790be4e=0, NULL=18007, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26b103ff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ee4bfc0=11, NULL=0, NULL=0, NULL=0, NULL=18006, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...