./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.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_8.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 37d0ed05d77a0379c9ed98058bf2f327252773ce .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:29:29,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:29:29,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:29:29,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:29:29,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:29:29,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:29:29,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:29:29,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:29:29,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:29:29,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:29:29,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:29:29,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:29:29,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:29:29,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:29:29,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:29:29,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:29:29,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:29:29,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:29:29,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:29:29,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:29:29,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:29:29,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:29:29,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:29:29,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:29:29,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:29:29,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:29:29,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:29:29,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:29:29,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:29:29,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:29:29,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:29:29,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:29:29,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:29:29,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:29:29,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:29:29,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:29:29,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:29:29,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:29:29,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:29:29,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:29:29,828 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,862 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:29:29,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:29:29,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:29:29,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:29:29,865 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:29:29,865 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:29:29,865 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:29:29,866 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:29:29,866 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:29:29,866 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:29:29,866 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:29:29,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:29:29,867 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:29:29,867 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:29:29,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:29:29,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:29:29,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:29:29,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:29:29,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:29:29,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:29:29,869 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:29:29,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:29:29,869 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:29:29,870 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:29:29,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:29:29,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:29:29,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:29:29,871 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:29:29,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:29:29,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:29:29,871 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:29:29,872 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:29:29,873 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:29:29,873 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 -> 37d0ed05d77a0379c9ed98058bf2f327252773ce [2020-10-26 04:29:30,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:29:30,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:29:30,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:29:30,339 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:29:30,340 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:29:30,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2020-10-26 04:29:30,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90755ef7d/c3134a85aa5340dbb0a516d0717e9824/FLAGd92d5bb1d [2020-10-26 04:29:30,984 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:29:30,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2020-10-26 04:29:30,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90755ef7d/c3134a85aa5340dbb0a516d0717e9824/FLAGd92d5bb1d [2020-10-26 04:29:31,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90755ef7d/c3134a85aa5340dbb0a516d0717e9824 [2020-10-26 04:29:31,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:29:31,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:29:31,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:29:31,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:29:31,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:29:31,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5900f071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:31, skipping insertion in model container [2020-10-26 04:29:31,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:29:31" (1/1) ... [2020-10-26 04:29:31,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:29:31,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:29:31,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:29:31,645 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:29:31,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:29:31,688 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:29:31,689 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,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:29:31,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:29:31,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:29:31,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:29:31,701 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,709 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,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:29:31,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:29:31,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:29:31,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:29:31,749 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,749 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,751 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,752 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,759 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,768 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,772 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,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:29:31,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:29:31,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:29:31,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:29:31,784 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,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:29:31,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:29:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:29:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:29:32,268 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:29:32,269 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-26 04:29:32,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:32 BoogieIcfgContainer [2020-10-26 04:29:32,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:29:32,272 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:29:32,272 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:29:32,275 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:29:32,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:32,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:29:31" (1/3) ... [2020-10-26 04:29:32,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3918e946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:29:32, skipping insertion in model container [2020-10-26 04:29:32,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:32,278 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:32,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3918e946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:29:32, skipping insertion in model container [2020-10-26 04:29:32,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:32,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:32" (3/3) ... [2020-10-26 04:29:32,280 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2020-10-26 04:29:32,339 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:29:32,340 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:29:32,340 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:29:32,340 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:29:32,340 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:29:32,340 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:29:32,340 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:29:32,340 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:29:32,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-10-26 04:29:32,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-10-26 04:29:32,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:32,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:32,386 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:32,386 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:32,386 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:29:32,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-10-26 04:29:32,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-10-26 04:29:32,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:32,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:32,391 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:32,391 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:32,404 INFO L794 eck$LassoCheckResult]: Stem: 32#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); 11#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_#t~nondet15, 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_~p8~0, main_~lk8~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 28#L127-1true [2020-10-26 04:29:32,406 INFO L796 eck$LassoCheckResult]: Loop: 28#L127-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 22#L37true 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;main_~lk8~0 := 0; 3#L58true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L58-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 8#L62-1true assume !(0 != main_~p3~0); 35#L66-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 23#L70-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 29#L74-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 16#L78-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 6#L82-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 31#L86-1true assume !(0 != main_~p1~0); 24#L92-1true assume !(0 != main_~p2~0); 33#L97-1true assume !(0 != main_~p3~0); 5#L102-1true assume !(0 != main_~p4~0); 12#L107-1true assume !(0 != main_~p5~0); 21#L112-1true assume !(0 != main_~p6~0); 10#L117-1true assume !(0 != main_~p7~0); 20#L122-1true assume !(0 != main_~p8~0); 28#L127-1true [2020-10-26 04:29:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:29:32,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312508357] [2020-10-26 04:29:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,655 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2020-10-26 04:29:32,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506395529] [2020-10-26 04:29:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:32,788 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,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506395529] [2020-10-26 04:29:32,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:32,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:32,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468133170] [2020-10-26 04:29:32,795 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:32,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:32,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:32,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:32,814 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-10-26 04:29:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:32,869 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2020-10-26 04:29:32,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:32,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2020-10-26 04:29:32,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2020-10-26 04:29:32,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2020-10-26 04:29:32,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-10-26 04:29:32,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-10-26 04:29:32,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2020-10-26 04:29:32,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:32,884 INFO L691 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-10-26 04:29:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2020-10-26 04:29:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-26 04:29:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-26 04:29:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2020-10-26 04:29:32,919 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-10-26 04:29:32,919 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-10-26 04:29:32,919 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:29:32,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2020-10-26 04:29:32,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2020-10-26 04:29:32,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:32,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:32,922 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:32,922 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:32,923 INFO L794 eck$LassoCheckResult]: Stem: 141#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); 122#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_#t~nondet15, 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_~p8~0, main_~lk8~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 123#L127-1 [2020-10-26 04:29:32,923 INFO L796 eck$LassoCheckResult]: Loop: 123#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 148#L37 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;main_~lk8~0 := 0; 147#L58 assume !(0 != main_~p1~0); 129#L58-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 115#L62-1 assume !(0 != main_~p3~0); 116#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 134#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 135#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 128#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 111#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 112#L86-1 assume !(0 != main_~p1~0); 142#L92-1 assume !(0 != main_~p2~0); 156#L97-1 assume !(0 != main_~p3~0); 155#L102-1 assume !(0 != main_~p4~0); 153#L107-1 assume !(0 != main_~p5~0); 132#L112-1 assume !(0 != main_~p6~0); 125#L117-1 assume !(0 != main_~p7~0); 130#L122-1 assume !(0 != main_~p8~0); 123#L127-1 [2020-10-26 04:29:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,924 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-26 04:29:32,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199187249] [2020-10-26 04:29:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:32,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:32,956 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2020-10-26 04:29:32,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:32,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115526796] [2020-10-26 04:29:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:32,982 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,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115526796] [2020-10-26 04:29:32,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:32,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:32,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880676364] [2020-10-26 04:29:32,983 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:32,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:32,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:32,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:32,985 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 3 states. [2020-10-26 04:29:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:33,005 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2020-10-26 04:29:33,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:33,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2020-10-26 04:29:33,012 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2020-10-26 04:29:33,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2020-10-26 04:29:33,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2020-10-26 04:29:33,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2020-10-26 04:29:33,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2020-10-26 04:29:33,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:33,017 INFO L691 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-10-26 04:29:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2020-10-26 04:29:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-26 04:29:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-26 04:29:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2020-10-26 04:29:33,037 INFO L714 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-10-26 04:29:33,037 INFO L594 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2020-10-26 04:29:33,037 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:29:33,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2020-10-26 04:29:33,039 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2020-10-26 04:29:33,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,040 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,040 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,041 INFO L794 eck$LassoCheckResult]: Stem: 305#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); 283#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_#t~nondet15, 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_~p8~0, main_~lk8~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 284#L127-1 [2020-10-26 04:29:33,049 INFO L796 eck$LassoCheckResult]: Loop: 284#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 324#L37 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;main_~lk8~0 := 0; 323#L58 assume !(0 != main_~p1~0); 322#L58-2 assume !(0 != main_~p2~0); 276#L62-1 assume !(0 != main_~p3~0); 277#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 296#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 297#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 289#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 290#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 309#L86-1 assume !(0 != main_~p1~0); 310#L92-1 assume !(0 != main_~p2~0); 306#L97-1 assume !(0 != main_~p3~0); 269#L102-1 assume !(0 != main_~p4~0); 271#L107-1 assume !(0 != main_~p5~0); 275#L112-1 assume !(0 != main_~p6~0); 286#L117-1 assume !(0 != main_~p7~0); 360#L122-1 assume !(0 != main_~p8~0); 284#L127-1 [2020-10-26 04:29:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,050 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-26 04:29:33,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093259925] [2020-10-26 04:29:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,076 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2020-10-26 04:29:33,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690506992] [2020-10-26 04:29:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:33,101 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,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690506992] [2020-10-26 04:29:33,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:33,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:33,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753868632] [2020-10-26 04:29:33,103 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:33,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:33,104 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand 3 states. [2020-10-26 04:29:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:33,127 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2020-10-26 04:29:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:33,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2020-10-26 04:29:33,132 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2020-10-26 04:29:33,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2020-10-26 04:29:33,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2020-10-26 04:29:33,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2020-10-26 04:29:33,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2020-10-26 04:29:33,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:33,137 INFO L691 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-10-26 04:29:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2020-10-26 04:29:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2020-10-26 04:29:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-26 04:29:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2020-10-26 04:29:33,153 INFO L714 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-10-26 04:29:33,153 INFO L594 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2020-10-26 04:29:33,153 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:29:33,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2020-10-26 04:29:33,156 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2020-10-26 04:29:33,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,157 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,157 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,157 INFO L794 eck$LassoCheckResult]: Stem: 609#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); 588#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_#t~nondet15, 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_~p8~0, main_~lk8~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 589#L127-1 [2020-10-26 04:29:33,158 INFO L796 eck$LassoCheckResult]: Loop: 589#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 674#L37 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;main_~lk8~0 := 0; 648#L58 assume !(0 != main_~p1~0); 633#L58-2 assume !(0 != main_~p2~0); 624#L62-1 assume !(0 != main_~p3~0); 625#L66-1 assume !(0 != main_~p4~0); 719#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 746#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 744#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 742#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 738#L86-1 assume !(0 != main_~p1~0); 739#L92-1 assume !(0 != main_~p2~0); 694#L97-1 assume !(0 != main_~p3~0); 691#L102-1 assume !(0 != main_~p4~0); 688#L107-1 assume !(0 != main_~p5~0); 685#L112-1 assume !(0 != main_~p6~0); 684#L117-1 assume !(0 != main_~p7~0); 680#L122-1 assume !(0 != main_~p8~0); 589#L127-1 [2020-10-26 04:29:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,158 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-26 04:29:33,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175276535] [2020-10-26 04:29:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,181 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2020-10-26 04:29:33,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124892790] [2020-10-26 04:29:33,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:33,203 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,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124892790] [2020-10-26 04:29:33,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:33,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:33,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677093495] [2020-10-26 04:29:33,205 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:33,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:33,206 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand 3 states. [2020-10-26 04:29:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:33,228 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2020-10-26 04:29:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:33,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2020-10-26 04:29:33,234 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2020-10-26 04:29:33,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2020-10-26 04:29:33,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2020-10-26 04:29:33,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2020-10-26 04:29:33,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2020-10-26 04:29:33,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:33,242 INFO L691 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-10-26 04:29:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2020-10-26 04:29:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2020-10-26 04:29:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-26 04:29:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2020-10-26 04:29:33,284 INFO L714 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-10-26 04:29:33,284 INFO L594 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2020-10-26 04:29:33,285 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:29:33,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2020-10-26 04:29:33,290 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2020-10-26 04:29:33,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,290 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,292 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,292 INFO L794 eck$LassoCheckResult]: Stem: 1199#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); 1178#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_#t~nondet15, 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_~p8~0, main_~lk8~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 1179#L127-1 [2020-10-26 04:29:33,292 INFO L796 eck$LassoCheckResult]: Loop: 1179#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1254#L37 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;main_~lk8~0 := 0; 1249#L58 assume !(0 != main_~p1~0); 1250#L58-2 assume !(0 != main_~p2~0); 1309#L62-1 assume !(0 != main_~p3~0); 1306#L66-1 assume !(0 != main_~p4~0); 1301#L70-1 assume !(0 != main_~p5~0); 1296#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1292#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1288#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1283#L86-1 assume !(0 != main_~p1~0); 1282#L92-1 assume !(0 != main_~p2~0); 1278#L97-1 assume !(0 != main_~p3~0); 1274#L102-1 assume !(0 != main_~p4~0); 1270#L107-1 assume !(0 != main_~p5~0); 1266#L112-1 assume !(0 != main_~p6~0); 1263#L117-1 assume !(0 != main_~p7~0); 1259#L122-1 assume !(0 != main_~p8~0); 1179#L127-1 [2020-10-26 04:29:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,293 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-26 04:29:33,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850270589] [2020-10-26 04:29:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2020-10-26 04:29:33,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022343166] [2020-10-26 04:29:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:33,365 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,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022343166] [2020-10-26 04:29:33,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:33,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:33,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493246465] [2020-10-26 04:29:33,367 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:33,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:33,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:33,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:33,368 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand 3 states. [2020-10-26 04:29:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:33,390 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2020-10-26 04:29:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:33,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2020-10-26 04:29:33,400 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2020-10-26 04:29:33,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2020-10-26 04:29:33,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2020-10-26 04:29:33,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2020-10-26 04:29:33,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2020-10-26 04:29:33,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:33,414 INFO L691 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-10-26 04:29:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2020-10-26 04:29:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2020-10-26 04:29:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2020-10-26 04:29:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2020-10-26 04:29:33,439 INFO L714 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-10-26 04:29:33,440 INFO L594 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2020-10-26 04:29:33,440 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:29:33,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2020-10-26 04:29:33,445 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2020-10-26 04:29:33,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,446 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,446 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,446 INFO L794 eck$LassoCheckResult]: Stem: 2348#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); 2324#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_#t~nondet15, 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_~p8~0, main_~lk8~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 2325#L127-1 [2020-10-26 04:29:33,446 INFO L796 eck$LassoCheckResult]: Loop: 2325#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2718#L37 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;main_~lk8~0 := 0; 2381#L58 assume !(0 != main_~p1~0); 2365#L58-2 assume !(0 != main_~p2~0); 2366#L62-1 assume !(0 != main_~p3~0); 2557#L66-1 assume !(0 != main_~p4~0); 2669#L70-1 assume !(0 != main_~p5~0); 2668#L74-1 assume !(0 != main_~p6~0); 2664#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2663#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2662#L86-1 assume !(0 != main_~p1~0); 2660#L92-1 assume !(0 != main_~p2~0); 2653#L97-1 assume !(0 != main_~p3~0); 2648#L102-1 assume !(0 != main_~p4~0); 2645#L107-1 assume !(0 != main_~p5~0); 2646#L112-1 assume !(0 != main_~p6~0); 2728#L117-1 assume !(0 != main_~p7~0); 2723#L122-1 assume !(0 != main_~p8~0); 2325#L127-1 [2020-10-26 04:29:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-26 04:29:33,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608253537] [2020-10-26 04:29:33,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,477 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2020-10-26 04:29:33,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649171900] [2020-10-26 04:29:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:33,499 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,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649171900] [2020-10-26 04:29:33,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:33,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:33,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236131356] [2020-10-26 04:29:33,501 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:33,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:33,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:33,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:33,502 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand 3 states. [2020-10-26 04:29:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:33,559 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2020-10-26 04:29:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:33,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2020-10-26 04:29:33,577 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2020-10-26 04:29:33,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2020-10-26 04:29:33,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2020-10-26 04:29:33,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2020-10-26 04:29:33,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2020-10-26 04:29:33,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:33,594 INFO L691 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-10-26 04:29:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2020-10-26 04:29:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2020-10-26 04:29:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2020-10-26 04:29:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2020-10-26 04:29:33,643 INFO L714 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-10-26 04:29:33,643 INFO L594 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2020-10-26 04:29:33,644 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:29:33,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2020-10-26 04:29:33,653 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2020-10-26 04:29:33,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,654 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,654 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,655 INFO L794 eck$LassoCheckResult]: Stem: 4579#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); 4557#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_#t~nondet15, 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_~p8~0, main_~lk8~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 4558#L127-1 [2020-10-26 04:29:33,655 INFO L796 eck$LassoCheckResult]: Loop: 4558#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4645#L37 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;main_~lk8~0 := 0; 4638#L58 assume !(0 != main_~p1~0); 4630#L58-2 assume !(0 != main_~p2~0); 4625#L62-1 assume !(0 != main_~p3~0); 4618#L66-1 assume !(0 != main_~p4~0); 4615#L70-1 assume !(0 != main_~p5~0); 4604#L74-1 assume !(0 != main_~p6~0); 4605#L78-1 assume !(0 != main_~p7~0); 4712#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4706#L86-1 assume !(0 != main_~p1~0); 4699#L92-1 assume !(0 != main_~p2~0); 4687#L97-1 assume !(0 != main_~p3~0); 4683#L102-1 assume !(0 != main_~p4~0); 4676#L107-1 assume !(0 != main_~p5~0); 4674#L112-1 assume !(0 != main_~p6~0); 4670#L117-1 assume !(0 != main_~p7~0); 4669#L122-1 assume !(0 != main_~p8~0); 4558#L127-1 [2020-10-26 04:29:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,655 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-26 04:29:33,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14658558] [2020-10-26 04:29:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,678 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2020-10-26 04:29:33,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992806298] [2020-10-26 04:29:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:33,698 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,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992806298] [2020-10-26 04:29:33,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:33,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:29:33,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594588596] [2020-10-26 04:29:33,699 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:33,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:33,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:33,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:33,700 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand 3 states. [2020-10-26 04:29:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:33,732 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2020-10-26 04:29:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:33,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2020-10-26 04:29:33,789 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2020-10-26 04:29:33,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2020-10-26 04:29:33,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2020-10-26 04:29:33,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2020-10-26 04:29:33,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2020-10-26 04:29:33,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:33,826 INFO L691 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-10-26 04:29:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2020-10-26 04:29:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2020-10-26 04:29:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2020-10-26 04:29:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2020-10-26 04:29:33,905 INFO L714 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-10-26 04:29:33,905 INFO L594 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2020-10-26 04:29:33,905 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:29:33,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2020-10-26 04:29:33,933 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2020-10-26 04:29:33,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,934 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,934 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,934 INFO L794 eck$LassoCheckResult]: Stem: 8940#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); 8919#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_#t~nondet15, 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_~p8~0, main_~lk8~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;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 8920#L127-1 [2020-10-26 04:29:33,935 INFO L796 eck$LassoCheckResult]: Loop: 8920#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 9016#L37 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;main_~lk8~0 := 0; 9011#L58 assume !(0 != main_~p1~0); 9003#L58-2 assume !(0 != main_~p2~0); 8996#L62-1 assume !(0 != main_~p3~0); 8991#L66-1 assume !(0 != main_~p4~0); 8983#L70-1 assume !(0 != main_~p5~0); 8984#L74-1 assume !(0 != main_~p6~0); 9065#L78-1 assume !(0 != main_~p7~0); 9061#L82-1 assume !(0 != main_~p8~0); 9057#L86-1 assume !(0 != main_~p1~0); 9053#L92-1 assume !(0 != main_~p2~0); 9049#L97-1 assume !(0 != main_~p3~0); 9045#L102-1 assume !(0 != main_~p4~0); 9043#L107-1 assume !(0 != main_~p5~0); 9036#L112-1 assume !(0 != main_~p6~0); 9031#L117-1 assume !(0 != main_~p7~0); 9026#L122-1 assume !(0 != main_~p8~0); 8920#L127-1 [2020-10-26 04:29:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-26 04:29:33,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876129949] [2020-10-26 04:29:33,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,957 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,958 INFO L82 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2020-10-26 04:29:33,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025922639] [2020-10-26 04:29:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,973 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2020-10-26 04:29:33,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084734949] [2020-10-26 04:29:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,999 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:34,448 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2020-10-26 04:29:34,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:29:34 BoogieIcfgContainer [2020-10-26 04:29:34,563 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:29:34,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:29:34,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:29:34,565 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:29:34,565 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:32" (3/4) ... [2020-10-26 04:29:34,568 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 04:29:34,620 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 04:29:34,621 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:29:34,622 INFO L168 Benchmark]: Toolchain (without parser) took 3239.46 ms. Allocated memory was 39.8 MB in the beginning and 117.4 MB in the end (delta: 77.6 MB). Free memory was 17.2 MB in the beginning and 71.0 MB in the end (delta: -53.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:34,623 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 39.8 MB. Free memory was 22.9 MB in the beginning and 22.9 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:29:34,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.47 ms. Allocated memory is still 39.8 MB. Free memory was 16.5 MB in the beginning and 15.9 MB in the end (delta: 623.7 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:34,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.65 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 15.8 MB in the beginning and 32.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:34,628 INFO L168 Benchmark]: Boogie Preprocessor took 40.50 ms. Allocated memory is still 48.2 MB. Free memory was 32.7 MB in the beginning and 31.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:34,629 INFO L168 Benchmark]: RCFGBuilder took 489.91 ms. Allocated memory is still 48.2 MB. Free memory was 31.4 MB in the beginning and 25.9 MB in the end (delta: 5.5 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:34,630 INFO L168 Benchmark]: BuchiAutomizer took 2292.00 ms. Allocated memory was 48.2 MB in the beginning and 117.4 MB in the end (delta: 69.2 MB). Free memory was 25.9 MB in the beginning and 73.1 MB in the end (delta: -47.2 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:34,631 INFO L168 Benchmark]: Witness Printer took 56.54 ms. Allocated memory is still 117.4 MB. Free memory was 73.1 MB in the beginning and 71.0 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:34,636 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.20 ms. Allocated memory is still 39.8 MB. Free memory was 22.9 MB in the beginning and 22.9 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 298.47 ms. Allocated memory is still 39.8 MB. Free memory was 16.5 MB in the beginning and 15.9 MB in the end (delta: 623.7 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.65 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 15.8 MB in the beginning and 32.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.50 ms. Allocated memory is still 48.2 MB. Free memory was 32.7 MB in the beginning and 31.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 489.91 ms. Allocated memory is still 48.2 MB. Free memory was 31.4 MB in the beginning and 25.9 MB in the end (delta: 5.5 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2292.00 ms. Allocated memory was 48.2 MB in the beginning and 117.4 MB in the end (delta: 69.2 MB). Free memory was 25.9 MB in the beginning and 73.1 MB in the end (delta: -47.2 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. * Witness Printer took 56.54 ms. Allocated memory is still 117.4 MB. Free memory was 73.1 MB in the beginning and 71.0 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 8 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 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2882 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 459 SDtfs, 236 SDslu, 277 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=3, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=1, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f9c581f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53ee47f4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d1417da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ef0d63b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13a1395a=0, cond=11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32511d3d=0, NULL=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f26666a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@777f24bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d8ea8e7=11, NULL=0, NULL=0, NULL=0, NULL=4, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: 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; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...