./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.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_14-1.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 1e59705ae4b9d6434bb0d27311e7a023ef1b3945 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:23,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:29:23,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:29:24,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:29:24,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:29:24,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:29:24,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:29:24,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:29:24,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:29:24,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:29:24,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:29:24,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:29:24,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:29:24,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:29:24,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:29:24,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:29:24,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:29:24,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:29:24,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:29:24,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:29:24,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:29:24,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:29:24,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:29:24,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:29:24,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:29:24,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:29:24,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:29:24,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:29:24,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:29:24,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:29:24,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:29:24,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:29:24,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:29:24,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:29:24,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:29:24,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:29:24,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:29:24,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:29:24,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:29:24,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:29:24,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:29:24,111 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:24,165 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:29:24,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:29:24,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:29:24,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:29:24,170 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:29:24,170 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:29:24,170 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:29:24,171 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:29:24,171 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:29:24,171 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:29:24,173 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:29:24,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:29:24,173 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:29:24,174 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:29:24,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:29:24,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:29:24,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:29:24,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:29:24,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:29:24,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:29:24,175 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:29:24,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:29:24,176 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:29:24,176 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:29:24,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:29:24,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:29:24,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:29:24,182 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:29:24,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:29:24,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:29:24,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:29:24,183 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:29:24,185 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:29:24,185 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 -> 1e59705ae4b9d6434bb0d27311e7a023ef1b3945 [2020-10-26 04:29:24,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:29:24,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:29:24,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:29:24,619 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:29:24,619 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:29:24,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2020-10-26 04:29:24,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9042d10/ad32d4bc075d4bfeb4eb06075febbcf5/FLAG811527c5c [2020-10-26 04:29:25,349 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:29:25,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2020-10-26 04:29:25,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9042d10/ad32d4bc075d4bfeb4eb06075febbcf5/FLAG811527c5c [2020-10-26 04:29:25,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9042d10/ad32d4bc075d4bfeb4eb06075febbcf5 [2020-10-26 04:29:25,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:29:25,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:29:25,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:29:25,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:29:25,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:29:25,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:29:25" (1/1) ... [2020-10-26 04:29:25,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a00516a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:25, skipping insertion in model container [2020-10-26 04:29:25,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:29:25" (1/1) ... [2020-10-26 04:29:25,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:29:25,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:29:25,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:29:25,912 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:29:25,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:29:25,962 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:29:25,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:25 WrapperNode [2020-10-26 04:29:25,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:29:25,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:29:25,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:29:25,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:29:25,975 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:25" (1/1) ... [2020-10-26 04:29:25,985 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:25" (1/1) ... [2020-10-26 04:29:26,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:29:26,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:29:26,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:29:26,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:29:26,023 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:25" (1/1) ... [2020-10-26 04:29:26,023 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:25" (1/1) ... [2020-10-26 04:29:26,025 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:25" (1/1) ... [2020-10-26 04:29:26,026 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:25" (1/1) ... [2020-10-26 04:29:26,037 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:25" (1/1) ... [2020-10-26 04:29:26,043 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:25" (1/1) ... [2020-10-26 04:29:26,045 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:25" (1/1) ... [2020-10-26 04:29:26,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:29:26,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:29:26,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:29:26,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:29:26,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:25" (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:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:29:26,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:29:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:29:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:29:26,906 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:29:26,907 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-26 04:29:26,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:26 BoogieIcfgContainer [2020-10-26 04:29:26,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:29:26,911 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:29:26,911 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:29:26,915 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:29:26,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:26,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:29:25" (1/3) ... [2020-10-26 04:29:26,917 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cf9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:29:26, skipping insertion in model container [2020-10-26 04:29:26,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:26,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:29:25" (2/3) ... [2020-10-26 04:29:26,918 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cf9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:29:26, skipping insertion in model container [2020-10-26 04:29:26,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:29:26,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:29:26" (3/3) ... [2020-10-26 04:29:26,920 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2020-10-26 04:29:27,005 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:29:27,005 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:29:27,006 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:29:27,006 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:29:27,006 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:29:27,006 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:29:27,007 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:29:27,007 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:29:27,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2020-10-26 04:29:27,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-26 04:29:27,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:27,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:27,059 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:27,059 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:27,060 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:29:27,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states. [2020-10-26 04:29:27,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-26 04:29:27,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:27,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:27,066 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:27,067 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:27,074 INFO L794 eck$LassoCheckResult]: Stem: 26#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 49#L211-1true [2020-10-26 04:29:27,076 INFO L796 eck$LassoCheckResult]: Loop: 49#L211-1true assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 30#L55true 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 31#L88true assume 0 != main_~p1~0;main_~lk1~0 := 1; 28#L88-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 19#L92-1true assume !(0 != main_~p3~0); 37#L96-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 43#L100-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 35#L104-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 52#L108-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 45#L112-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 50#L116-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 14#L120-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 4#L124-1true assume !(0 != main_~p11~0); 25#L128-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 32#L132-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 22#L136-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 39#L140-1true assume !(0 != main_~p1~0); 5#L146-1true assume !(0 != main_~p2~0); 40#L151-1true assume !(0 != main_~p3~0); 47#L156-1true assume !(0 != main_~p4~0); 27#L161-1true assume !(0 != main_~p5~0); 33#L166-1true assume !(0 != main_~p6~0); 11#L171-1true assume !(0 != main_~p7~0); 18#L176-1true assume !(0 != main_~p8~0); 36#L181-1true assume !(0 != main_~p9~0); 17#L186-1true assume !(0 != main_~p10~0); 24#L191-1true assume !(0 != main_~p11~0); 54#L196-1true assume !(0 != main_~p12~0); 7#L201-1true assume !(0 != main_~p13~0); 42#L206-1true assume !(0 != main_~p14~0); 49#L211-1true [2020-10-26 04:29:27,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:29:27,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:27,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477042534] [2020-10-26 04:29:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:27,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:27,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:27,245 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:27,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:27,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2020-10-26 04:29:27,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:27,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317822853] [2020-10-26 04:29:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:27,362 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:27,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317822853] [2020-10-26 04:29:27,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:27,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:27,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295226919] [2020-10-26 04:29:27,379 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:27,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:27,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:27,401 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-10-26 04:29:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:27,477 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2020-10-26 04:29:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:27,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2020-10-26 04:29:27,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2020-10-26 04:29:27,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2020-10-26 04:29:27,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-26 04:29:27,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-10-26 04:29:27,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2020-10-26 04:29:27,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:27,505 INFO L691 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2020-10-26 04:29:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2020-10-26 04:29:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-26 04:29:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-26 04:29:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2020-10-26 04:29:27,542 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2020-10-26 04:29:27,542 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2020-10-26 04:29:27,542 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:29:27,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2020-10-26 04:29:27,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2020-10-26 04:29:27,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:27,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:27,546 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:27,546 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:27,546 INFO L794 eck$LassoCheckResult]: Stem: 206#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 184#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 185#L211-1 [2020-10-26 04:29:27,547 INFO L796 eck$LassoCheckResult]: Loop: 185#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 208#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 209#L88 assume !(0 != main_~p1~0); 211#L88-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 248#L92-1 assume !(0 != main_~p3~0); 247#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 246#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 245#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 244#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 243#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 242#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 241#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 240#L124-1 assume !(0 != main_~p11~0); 239#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 238#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 237#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 236#L140-1 assume !(0 != main_~p1~0); 235#L146-1 assume !(0 != main_~p2~0); 233#L151-1 assume !(0 != main_~p3~0); 231#L156-1 assume !(0 != main_~p4~0); 229#L161-1 assume !(0 != main_~p5~0); 227#L166-1 assume !(0 != main_~p6~0); 224#L171-1 assume !(0 != main_~p7~0); 200#L176-1 assume !(0 != main_~p8~0); 179#L181-1 assume !(0 != main_~p9~0); 180#L186-1 assume !(0 != main_~p10~0); 219#L191-1 assume !(0 != main_~p11~0); 217#L196-1 assume !(0 != main_~p12~0); 215#L201-1 assume !(0 != main_~p13~0); 213#L206-1 assume !(0 != main_~p14~0); 185#L211-1 [2020-10-26 04:29:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-26 04:29:27,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:27,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30898802] [2020-10-26 04:29:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:27,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:27,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:27,581 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:27,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2020-10-26 04:29:27,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:27,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077150436] [2020-10-26 04:29:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:27,632 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:27,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077150436] [2020-10-26 04:29:27,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:27,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:27,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699722194] [2020-10-26 04:29:27,634 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:27,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:27,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:27,635 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand 3 states. [2020-10-26 04:29:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:27,668 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2020-10-26 04:29:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:27,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2020-10-26 04:29:27,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2020-10-26 04:29:27,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2020-10-26 04:29:27,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2020-10-26 04:29:27,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2020-10-26 04:29:27,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2020-10-26 04:29:27,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:27,679 INFO L691 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2020-10-26 04:29:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2020-10-26 04:29:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-10-26 04:29:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-26 04:29:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2020-10-26 04:29:27,713 INFO L714 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2020-10-26 04:29:27,713 INFO L594 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2020-10-26 04:29:27,713 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:29:27,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2020-10-26 04:29:27,719 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2020-10-26 04:29:27,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:27,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:27,720 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:27,721 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:27,725 INFO L794 eck$LassoCheckResult]: Stem: 477#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 452#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 453#L211-1 [2020-10-26 04:29:27,725 INFO L796 eck$LassoCheckResult]: Loop: 453#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 480#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 481#L88 assume !(0 != main_~p1~0); 553#L88-2 assume !(0 != main_~p2~0); 551#L92-1 assume !(0 != main_~p3~0); 549#L96-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 547#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 440#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 441#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 469#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 470#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 462#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 434#L124-1 assume !(0 != main_~p11~0); 435#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 476#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 486#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 520#L140-1 assume !(0 != main_~p1~0); 519#L146-1 assume !(0 != main_~p2~0); 459#L151-1 assume !(0 != main_~p3~0); 443#L156-1 assume !(0 != main_~p4~0); 464#L161-1 assume !(0 != main_~p5~0); 429#L166-1 assume !(0 != main_~p6~0); 430#L171-1 assume !(0 != main_~p7~0); 439#L176-1 assume !(0 != main_~p8~0); 461#L181-1 assume !(0 != main_~p9~0); 500#L186-1 assume !(0 != main_~p10~0); 495#L191-1 assume !(0 != main_~p11~0); 493#L196-1 assume !(0 != main_~p12~0); 491#L201-1 assume !(0 != main_~p13~0); 489#L206-1 assume !(0 != main_~p14~0); 453#L211-1 [2020-10-26 04:29:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-26 04:29:27,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:27,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990167060] [2020-10-26 04:29:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:27,756 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:27,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:27,794 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:27,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2020-10-26 04:29:27,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:27,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944204971] [2020-10-26 04:29:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:27,872 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:27,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944204971] [2020-10-26 04:29:27,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:27,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:27,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619796064] [2020-10-26 04:29:27,874 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:27,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:27,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:27,877 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand 3 states. [2020-10-26 04:29:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:27,929 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2020-10-26 04:29:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:27,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2020-10-26 04:29:27,935 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2020-10-26 04:29:27,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2020-10-26 04:29:27,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2020-10-26 04:29:27,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2020-10-26 04:29:27,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2020-10-26 04:29:27,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:27,957 INFO L691 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2020-10-26 04:29:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2020-10-26 04:29:27,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2020-10-26 04:29:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-10-26 04:29:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2020-10-26 04:29:28,002 INFO L714 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2020-10-26 04:29:28,002 INFO L594 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2020-10-26 04:29:28,002 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:29:28,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2020-10-26 04:29:28,005 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2020-10-26 04:29:28,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:28,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:28,006 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:28,006 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:28,006 INFO L794 eck$LassoCheckResult]: Stem: 1001#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 974#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 975#L211-1 [2020-10-26 04:29:28,006 INFO L796 eck$LassoCheckResult]: Loop: 975#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 1065#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 1062#L88 assume !(0 != main_~p1~0); 1058#L88-2 assume !(0 != main_~p2~0); 1055#L92-1 assume !(0 != main_~p3~0); 1052#L96-1 assume !(0 != main_~p4~0); 1053#L100-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1047#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1048#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1043#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1044#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1039#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1040#L124-1 assume !(0 != main_~p11~0); 1035#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1036#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1031#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1032#L140-1 assume !(0 != main_~p1~0); 1114#L146-1 assume !(0 != main_~p2~0); 1111#L151-1 assume !(0 != main_~p3~0); 1108#L156-1 assume !(0 != main_~p4~0); 1106#L161-1 assume !(0 != main_~p5~0); 1102#L166-1 assume !(0 != main_~p6~0); 1097#L171-1 assume !(0 != main_~p7~0); 1094#L176-1 assume !(0 != main_~p8~0); 1090#L181-1 assume !(0 != main_~p9~0); 1085#L186-1 assume !(0 != main_~p10~0); 1082#L191-1 assume !(0 != main_~p11~0); 1078#L196-1 assume !(0 != main_~p12~0); 1074#L201-1 assume !(0 != main_~p13~0); 1070#L206-1 assume !(0 != main_~p14~0); 975#L211-1 [2020-10-26 04:29:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-26 04:29:28,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:28,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418529729] [2020-10-26 04:29:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:28,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:28,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:28,031 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2020-10-26 04:29:28,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:28,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808038392] [2020-10-26 04:29:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:28,063 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:28,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808038392] [2020-10-26 04:29:28,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:28,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:28,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203492824] [2020-10-26 04:29:28,064 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:28,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:28,066 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand 3 states. [2020-10-26 04:29:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:28,098 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2020-10-26 04:29:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:28,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2020-10-26 04:29:28,106 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2020-10-26 04:29:28,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2020-10-26 04:29:28,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2020-10-26 04:29:28,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2020-10-26 04:29:28,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2020-10-26 04:29:28,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:28,116 INFO L691 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2020-10-26 04:29:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2020-10-26 04:29:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2020-10-26 04:29:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-10-26 04:29:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2020-10-26 04:29:28,138 INFO L714 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2020-10-26 04:29:28,138 INFO L594 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2020-10-26 04:29:28,138 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:29:28,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2020-10-26 04:29:28,144 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2020-10-26 04:29:28,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:28,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:28,145 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:28,145 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:28,145 INFO L794 eck$LassoCheckResult]: Stem: 2023#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1996#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 1997#L211-1 [2020-10-26 04:29:28,146 INFO L796 eck$LassoCheckResult]: Loop: 1997#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 2114#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 2110#L88 assume !(0 != main_~p1~0); 2108#L88-2 assume !(0 != main_~p2~0); 2106#L92-1 assume !(0 != main_~p3~0); 2102#L96-1 assume !(0 != main_~p4~0); 2098#L100-1 assume !(0 != main_~p5~0); 2096#L104-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2094#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2092#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2090#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2088#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2086#L124-1 assume !(0 != main_~p11~0); 2084#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2082#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2080#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2076#L140-1 assume !(0 != main_~p1~0); 2074#L146-1 assume !(0 != main_~p2~0); 2068#L151-1 assume !(0 != main_~p3~0); 2067#L156-1 assume !(0 != main_~p4~0); 2153#L161-1 assume !(0 != main_~p5~0); 2150#L166-1 assume !(0 != main_~p6~0); 2145#L171-1 assume !(0 != main_~p7~0); 2142#L176-1 assume !(0 != main_~p8~0); 2138#L181-1 assume !(0 != main_~p9~0); 2133#L186-1 assume !(0 != main_~p10~0); 2130#L191-1 assume !(0 != main_~p11~0); 2126#L196-1 assume !(0 != main_~p12~0); 2122#L201-1 assume !(0 != main_~p13~0); 2118#L206-1 assume !(0 != main_~p14~0); 1997#L211-1 [2020-10-26 04:29:28,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:28,146 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-26 04:29:28,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:28,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131230709] [2020-10-26 04:29:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:28,156 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:28,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:28,181 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:28,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2020-10-26 04:29:28,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:28,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493827603] [2020-10-26 04:29:28,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:28,218 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:28,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493827603] [2020-10-26 04:29:28,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:28,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:28,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205732971] [2020-10-26 04:29:28,219 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:28,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:28,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:28,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:28,220 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand 3 states. [2020-10-26 04:29:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:28,261 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2020-10-26 04:29:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:28,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2020-10-26 04:29:28,277 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2020-10-26 04:29:28,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2020-10-26 04:29:28,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2020-10-26 04:29:28,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2020-10-26 04:29:28,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2020-10-26 04:29:28,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:28,294 INFO L691 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2020-10-26 04:29:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2020-10-26 04:29:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2020-10-26 04:29:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-10-26 04:29:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2020-10-26 04:29:28,329 INFO L714 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2020-10-26 04:29:28,329 INFO L594 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2020-10-26 04:29:28,329 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:29:28,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2020-10-26 04:29:28,339 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2020-10-26 04:29:28,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:28,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:28,340 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:28,340 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:28,340 INFO L794 eck$LassoCheckResult]: Stem: 4035#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4005#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 4006#L211-1 [2020-10-26 04:29:28,353 INFO L796 eck$LassoCheckResult]: Loop: 4006#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 4189#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 4190#L88 assume !(0 != main_~p1~0); 4306#L88-2 assume !(0 != main_~p2~0); 4352#L92-1 assume !(0 != main_~p3~0); 4297#L96-1 assume !(0 != main_~p4~0); 4299#L100-1 assume !(0 != main_~p5~0); 4364#L104-1 assume !(0 != main_~p6~0); 4363#L108-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4362#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4361#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4360#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4359#L124-1 assume !(0 != main_~p11~0); 4358#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4357#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4356#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4354#L140-1 assume !(0 != main_~p1~0); 4327#L146-1 assume !(0 != main_~p2~0); 4325#L151-1 assume !(0 != main_~p3~0); 4253#L156-1 assume !(0 != main_~p4~0); 4255#L161-1 assume !(0 != main_~p5~0); 4320#L166-1 assume !(0 != main_~p6~0); 4238#L171-1 assume !(0 != main_~p7~0); 4234#L176-1 assume !(0 != main_~p8~0); 4233#L181-1 assume !(0 != main_~p9~0); 4220#L186-1 assume !(0 != main_~p10~0); 4221#L191-1 assume !(0 != main_~p11~0); 4211#L196-1 assume !(0 != main_~p12~0); 4210#L201-1 assume !(0 != main_~p13~0); 4199#L206-1 assume !(0 != main_~p14~0); 4006#L211-1 [2020-10-26 04:29:28,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-26 04:29:28,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:28,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249192953] [2020-10-26 04:29:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:28,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:28,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:28,375 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2020-10-26 04:29:28,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:28,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389760657] [2020-10-26 04:29:28,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:28,415 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:28,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389760657] [2020-10-26 04:29:28,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:28,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:28,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734239181] [2020-10-26 04:29:28,417 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:28,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:28,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:28,419 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand 3 states. [2020-10-26 04:29:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:28,462 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2020-10-26 04:29:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:28,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2020-10-26 04:29:28,495 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2020-10-26 04:29:28,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2020-10-26 04:29:28,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2020-10-26 04:29:28,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2020-10-26 04:29:28,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2020-10-26 04:29:28,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:28,528 INFO L691 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2020-10-26 04:29:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2020-10-26 04:29:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2020-10-26 04:29:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2020-10-26 04:29:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2020-10-26 04:29:28,618 INFO L714 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2020-10-26 04:29:28,618 INFO L594 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2020-10-26 04:29:28,619 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:29:28,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2020-10-26 04:29:28,648 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2020-10-26 04:29:28,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:28,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:28,650 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:28,651 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:28,651 INFO L794 eck$LassoCheckResult]: Stem: 7997#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7967#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 7968#L211-1 [2020-10-26 04:29:28,651 INFO L796 eck$LassoCheckResult]: Loop: 7968#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 8160#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 8158#L88 assume !(0 != main_~p1~0); 8156#L88-2 assume !(0 != main_~p2~0); 8153#L92-1 assume !(0 != main_~p3~0); 8150#L96-1 assume !(0 != main_~p4~0); 8147#L100-1 assume !(0 != main_~p5~0); 8139#L104-1 assume !(0 != main_~p6~0); 8141#L108-1 assume !(0 != main_~p7~0); 8131#L112-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8132#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8123#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8124#L124-1 assume !(0 != main_~p11~0); 8115#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8116#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8107#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8108#L140-1 assume !(0 != main_~p1~0); 8095#L146-1 assume !(0 != main_~p2~0); 8097#L151-1 assume !(0 != main_~p3~0); 8083#L156-1 assume !(0 != main_~p4~0); 8085#L161-1 assume !(0 != main_~p5~0); 8186#L166-1 assume !(0 != main_~p6~0); 8184#L171-1 assume !(0 != main_~p7~0); 8183#L176-1 assume !(0 != main_~p8~0); 8181#L181-1 assume !(0 != main_~p9~0); 8178#L186-1 assume !(0 != main_~p10~0); 8174#L191-1 assume !(0 != main_~p11~0); 8171#L196-1 assume !(0 != main_~p12~0); 8168#L201-1 assume !(0 != main_~p13~0); 8165#L206-1 assume !(0 != main_~p14~0); 7968#L211-1 [2020-10-26 04:29:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2020-10-26 04:29:28,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:28,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302499715] [2020-10-26 04:29:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:28,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:28,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:28,705 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2020-10-26 04:29:28,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:28,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397571491] [2020-10-26 04:29:28,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:28,754 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:28,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397571491] [2020-10-26 04:29:28,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:28,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:28,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686445281] [2020-10-26 04:29:28,756 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:28,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:28,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:28,758 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2020-10-26 04:29:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:28,822 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2020-10-26 04:29:28,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:28,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2020-10-26 04:29:28,876 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2020-10-26 04:29:28,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2020-10-26 04:29:28,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2020-10-26 04:29:28,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2020-10-26 04:29:28,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2020-10-26 04:29:28,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:28,948 INFO L691 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2020-10-26 04:29:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2020-10-26 04:29:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2020-10-26 04:29:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5186 states. [2020-10-26 04:29:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2020-10-26 04:29:29,108 INFO L714 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2020-10-26 04:29:29,109 INFO L594 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2020-10-26 04:29:29,109 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:29:29,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2020-10-26 04:29:29,169 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2020-10-26 04:29:29,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:29,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:29,172 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:29,173 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:29,173 INFO L794 eck$LassoCheckResult]: Stem: 15815#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 15785#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 15786#L211-1 [2020-10-26 04:29:29,174 INFO L796 eck$LassoCheckResult]: Loop: 15786#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 15907#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 15904#L88 assume !(0 != main_~p1~0); 15900#L88-2 assume !(0 != main_~p2~0); 15897#L92-1 assume !(0 != main_~p3~0); 15894#L96-1 assume !(0 != main_~p4~0); 15890#L100-1 assume !(0 != main_~p5~0); 15891#L104-1 assume !(0 != main_~p6~0); 15980#L108-1 assume !(0 != main_~p7~0); 15976#L112-1 assume !(0 != main_~p8~0); 15974#L116-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 15972#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 15970#L124-1 assume !(0 != main_~p11~0); 15968#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 15966#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 15964#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 15960#L140-1 assume !(0 != main_~p1~0); 15956#L146-1 assume !(0 != main_~p2~0); 15953#L151-1 assume !(0 != main_~p3~0); 15948#L156-1 assume !(0 != main_~p4~0); 15946#L161-1 assume !(0 != main_~p5~0); 15943#L166-1 assume !(0 != main_~p6~0); 15939#L171-1 assume !(0 != main_~p7~0); 15935#L176-1 assume !(0 != main_~p8~0); 15932#L181-1 assume !(0 != main_~p9~0); 15927#L186-1 assume !(0 != main_~p10~0); 15924#L191-1 assume !(0 != main_~p11~0); 15920#L196-1 assume !(0 != main_~p12~0); 15916#L201-1 assume !(0 != main_~p13~0); 15912#L206-1 assume !(0 != main_~p14~0); 15786#L211-1 [2020-10-26 04:29:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2020-10-26 04:29:29,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:29,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817008642] [2020-10-26 04:29:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:29,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:29,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:29,233 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:29,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2020-10-26 04:29:29,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:29,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819594984] [2020-10-26 04:29:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:29,370 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:29,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819594984] [2020-10-26 04:29:29,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:29,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:29,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465148437] [2020-10-26 04:29:29,372 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:29,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:29,378 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2020-10-26 04:29:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:29,481 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2020-10-26 04:29:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:29,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2020-10-26 04:29:29,602 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2020-10-26 04:29:29,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2020-10-26 04:29:29,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2020-10-26 04:29:29,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2020-10-26 04:29:29,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2020-10-26 04:29:29,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:29,722 INFO L691 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2020-10-26 04:29:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2020-10-26 04:29:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2020-10-26 04:29:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10242 states. [2020-10-26 04:29:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2020-10-26 04:29:30,046 INFO L714 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2020-10-26 04:29:30,046 INFO L594 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2020-10-26 04:29:30,046 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 04:29:30,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2020-10-26 04:29:30,117 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2020-10-26 04:29:30,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:30,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:30,119 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:30,119 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:30,120 INFO L794 eck$LassoCheckResult]: Stem: 31249#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 31218#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 31219#L211-1 [2020-10-26 04:29:30,121 INFO L796 eck$LassoCheckResult]: Loop: 31219#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 31390#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 31387#L88 assume !(0 != main_~p1~0); 31383#L88-2 assume !(0 != main_~p2~0); 31380#L92-1 assume !(0 != main_~p3~0); 31377#L96-1 assume !(0 != main_~p4~0); 31370#L100-1 assume !(0 != main_~p5~0); 31309#L104-1 assume !(0 != main_~p6~0); 31310#L108-1 assume !(0 != main_~p7~0); 31491#L112-1 assume !(0 != main_~p8~0); 31489#L116-1 assume !(0 != main_~p9~0); 31478#L120-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 31473#L124-1 assume !(0 != main_~p11~0); 31469#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 31465#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 31460#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 31451#L140-1 assume !(0 != main_~p1~0); 31448#L146-1 assume !(0 != main_~p2~0); 31437#L151-1 assume !(0 != main_~p3~0); 31428#L156-1 assume !(0 != main_~p4~0); 31371#L161-1 assume !(0 != main_~p5~0); 31373#L166-1 assume !(0 != main_~p6~0); 31422#L171-1 assume !(0 != main_~p7~0); 31418#L176-1 assume !(0 != main_~p8~0); 31414#L181-1 assume !(0 != main_~p9~0); 31410#L186-1 assume !(0 != main_~p10~0); 31407#L191-1 assume !(0 != main_~p11~0); 31403#L196-1 assume !(0 != main_~p12~0); 31399#L201-1 assume !(0 != main_~p13~0); 31395#L206-1 assume !(0 != main_~p14~0); 31219#L211-1 [2020-10-26 04:29:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2020-10-26 04:29:30,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:30,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710552054] [2020-10-26 04:29:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:30,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:30,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:30,149 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2020-10-26 04:29:30,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:30,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486763707] [2020-10-26 04:29:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:30,185 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:30,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486763707] [2020-10-26 04:29:30,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:30,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:30,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745514716] [2020-10-26 04:29:30,187 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:30,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:30,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:30,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:30,190 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2020-10-26 04:29:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:30,314 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2020-10-26 04:29:30,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:30,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2020-10-26 04:29:30,583 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2020-10-26 04:29:30,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2020-10-26 04:29:30,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2020-10-26 04:29:30,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2020-10-26 04:29:30,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2020-10-26 04:29:30,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:30,723 INFO L691 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2020-10-26 04:29:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2020-10-26 04:29:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2020-10-26 04:29:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20226 states. [2020-10-26 04:29:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2020-10-26 04:29:31,179 INFO L714 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2020-10-26 04:29:31,179 INFO L594 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2020-10-26 04:29:31,179 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 04:29:31,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2020-10-26 04:29:31,272 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2020-10-26 04:29:31,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:31,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:31,273 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:31,273 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:31,274 INFO L794 eck$LassoCheckResult]: Stem: 61724#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 61692#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 61693#L211-1 [2020-10-26 04:29:31,274 INFO L796 eck$LassoCheckResult]: Loop: 61693#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 62130#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 62127#L88 assume !(0 != main_~p1~0); 62123#L88-2 assume !(0 != main_~p2~0); 62120#L92-1 assume !(0 != main_~p3~0); 62117#L96-1 assume !(0 != main_~p4~0); 62110#L100-1 assume !(0 != main_~p5~0); 62111#L104-1 assume !(0 != main_~p6~0); 62065#L108-1 assume !(0 != main_~p7~0); 62067#L112-1 assume !(0 != main_~p8~0); 62196#L116-1 assume !(0 != main_~p9~0); 62193#L120-1 assume !(0 != main_~p10~0); 62191#L124-1 assume !(0 != main_~p11~0); 62189#L128-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 62187#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 62183#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 62178#L140-1 assume !(0 != main_~p1~0); 62176#L146-1 assume !(0 != main_~p2~0); 62172#L151-1 assume !(0 != main_~p3~0); 62166#L156-1 assume !(0 != main_~p4~0); 62164#L161-1 assume !(0 != main_~p5~0); 62160#L166-1 assume !(0 != main_~p6~0); 62112#L171-1 assume !(0 != main_~p7~0); 62113#L176-1 assume !(0 != main_~p8~0); 62154#L181-1 assume !(0 != main_~p9~0); 62150#L186-1 assume !(0 != main_~p10~0); 62147#L191-1 assume !(0 != main_~p11~0); 62143#L196-1 assume !(0 != main_~p12~0); 62139#L201-1 assume !(0 != main_~p13~0); 62135#L206-1 assume !(0 != main_~p14~0); 61693#L211-1 [2020-10-26 04:29:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2020-10-26 04:29:31,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:31,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259213100] [2020-10-26 04:29:31,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:31,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:31,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:31,310 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:31,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2020-10-26 04:29:31,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:31,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151597300] [2020-10-26 04:29:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:31,346 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:31,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151597300] [2020-10-26 04:29:31,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:31,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:31,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090609799] [2020-10-26 04:29:31,348 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:31,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:31,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:31,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:31,350 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2020-10-26 04:29:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:31,666 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2020-10-26 04:29:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:31,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2020-10-26 04:29:31,874 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2020-10-26 04:29:32,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2020-10-26 04:29:32,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2020-10-26 04:29:32,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2020-10-26 04:29:32,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2020-10-26 04:29:32,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:32,255 INFO L691 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2020-10-26 04:29:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2020-10-26 04:29:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2020-10-26 04:29:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39938 states. [2020-10-26 04:29:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2020-10-26 04:29:33,218 INFO L714 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2020-10-26 04:29:33,218 INFO L594 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2020-10-26 04:29:33,218 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 04:29:33,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2020-10-26 04:29:33,391 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2020-10-26 04:29:33,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:33,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:33,393 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:33,393 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:33,393 INFO L794 eck$LassoCheckResult]: Stem: 121900#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 121862#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 121863#L211-1 [2020-10-26 04:29:33,394 INFO L796 eck$LassoCheckResult]: Loop: 121863#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 122059#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 122055#L88 assume !(0 != main_~p1~0); 122048#L88-2 assume !(0 != main_~p2~0); 122043#L92-1 assume !(0 != main_~p3~0); 122036#L96-1 assume !(0 != main_~p4~0); 122028#L100-1 assume !(0 != main_~p5~0); 122020#L104-1 assume !(0 != main_~p6~0); 122012#L108-1 assume !(0 != main_~p7~0); 122004#L112-1 assume !(0 != main_~p8~0); 121996#L116-1 assume !(0 != main_~p9~0); 121988#L120-1 assume !(0 != main_~p10~0); 121983#L124-1 assume !(0 != main_~p11~0); 121978#L128-1 assume !(0 != main_~p12~0); 121972#L132-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 121973#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 121964#L140-1 assume !(0 != main_~p1~0); 121966#L146-1 assume !(0 != main_~p2~0); 122148#L151-1 assume !(0 != main_~p3~0); 122143#L156-1 assume !(0 != main_~p4~0); 122109#L161-1 assume !(0 != main_~p5~0); 122101#L166-1 assume !(0 != main_~p6~0); 122094#L171-1 assume !(0 != main_~p7~0); 122090#L176-1 assume !(0 != main_~p8~0); 122088#L181-1 assume !(0 != main_~p9~0); 122084#L186-1 assume !(0 != main_~p10~0); 122083#L191-1 assume !(0 != main_~p11~0); 122081#L196-1 assume !(0 != main_~p12~0); 122080#L201-1 assume !(0 != main_~p13~0); 122068#L206-1 assume !(0 != main_~p14~0); 121863#L211-1 [2020-10-26 04:29:33,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2020-10-26 04:29:33,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063955441] [2020-10-26 04:29:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:33,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:33,586 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:33,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2020-10-26 04:29:33,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:33,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43297188] [2020-10-26 04:29:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:33,627 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,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43297188] [2020-10-26 04:29:33,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:33,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:29:33,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392763746] [2020-10-26 04:29:33,629 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:33,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:33,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:33,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:33,630 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2020-10-26 04:29:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:34,034 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2020-10-26 04:29:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:34,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2020-10-26 04:29:34,564 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2020-10-26 04:29:35,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2020-10-26 04:29:35,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2020-10-26 04:29:35,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2020-10-26 04:29:35,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2020-10-26 04:29:35,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:35,335 INFO L691 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2020-10-26 04:29:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2020-10-26 04:29:36,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2020-10-26 04:29:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78850 states. [2020-10-26 04:29:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2020-10-26 04:29:36,757 INFO L714 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2020-10-26 04:29:36,757 INFO L594 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2020-10-26 04:29:36,757 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 04:29:36,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2020-10-26 04:29:37,007 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2020-10-26 04:29:37,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:37,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:37,009 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:37,009 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:37,009 INFO L794 eck$LassoCheckResult]: Stem: 240693#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 240655#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 240656#L211-1 [2020-10-26 04:29:37,010 INFO L796 eck$LassoCheckResult]: Loop: 240656#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 240912#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 240907#L88 assume !(0 != main_~p1~0); 240901#L88-2 assume !(0 != main_~p2~0); 240897#L92-1 assume !(0 != main_~p3~0); 240892#L96-1 assume !(0 != main_~p4~0); 240885#L100-1 assume !(0 != main_~p5~0); 240883#L104-1 assume !(0 != main_~p6~0); 240881#L108-1 assume !(0 != main_~p7~0); 240879#L112-1 assume !(0 != main_~p8~0); 240876#L116-1 assume !(0 != main_~p9~0); 240873#L120-1 assume !(0 != main_~p10~0); 240777#L124-1 assume !(0 != main_~p11~0); 240773#L128-1 assume !(0 != main_~p12~0); 240762#L132-1 assume !(0 != main_~p13~0); 240763#L136-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 240752#L140-1 assume !(0 != main_~p1~0); 240754#L146-1 assume !(0 != main_~p2~0); 241013#L151-1 assume !(0 != main_~p3~0); 241010#L156-1 assume !(0 != main_~p4~0); 241008#L161-1 assume !(0 != main_~p5~0); 241005#L166-1 assume !(0 != main_~p6~0); 241001#L171-1 assume !(0 != main_~p7~0); 240997#L176-1 assume !(0 != main_~p8~0); 240938#L181-1 assume !(0 != main_~p9~0); 240934#L186-1 assume !(0 != main_~p10~0); 240925#L191-1 assume !(0 != main_~p11~0); 240922#L196-1 assume !(0 != main_~p12~0); 240920#L201-1 assume !(0 != main_~p13~0); 240918#L206-1 assume !(0 != main_~p14~0); 240656#L211-1 [2020-10-26 04:29:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2020-10-26 04:29:37,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:37,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452122173] [2020-10-26 04:29:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:37,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:37,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:37,025 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2020-10-26 04:29:37,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:37,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589656038] [2020-10-26 04:29:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:29:37,050 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:37,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589656038] [2020-10-26 04:29:37,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:29:37,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:29:37,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010881600] [2020-10-26 04:29:37,052 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:29:37,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:29:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:29:37,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:29:37,053 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand 3 states. [2020-10-26 04:29:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:29:37,863 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2020-10-26 04:29:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:29:37,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2020-10-26 04:29:38,793 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2020-10-26 04:29:39,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2020-10-26 04:29:39,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2020-10-26 04:29:39,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2020-10-26 04:29:39,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2020-10-26 04:29:39,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:29:39,368 INFO L691 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2020-10-26 04:29:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2020-10-26 04:29:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2020-10-26 04:29:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155650 states. [2020-10-26 04:29:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2020-10-26 04:29:41,534 INFO L714 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2020-10-26 04:29:41,534 INFO L594 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2020-10-26 04:29:41,534 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-26 04:29:41,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2020-10-26 04:29:42,635 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2020-10-26 04:29:42,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:29:42,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:29:42,638 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:29:42,640 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:29:42,655 INFO L794 eck$LassoCheckResult]: Stem: 475196#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(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 475161#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_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, 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_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~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;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;havoc main_~cond~0; 475162#L211-1 [2020-10-26 04:29:42,656 INFO L796 eck$LassoCheckResult]: Loop: 475162#L211-1 assume !false;main_~cond~0 := main_#t~nondet21;havoc main_#t~nondet21; 476638#L55 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;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0; 476628#L88 assume !(0 != main_~p1~0); 476630#L88-2 assume !(0 != main_~p2~0); 476771#L92-1 assume !(0 != main_~p3~0); 476770#L96-1 assume !(0 != main_~p4~0); 476764#L100-1 assume !(0 != main_~p5~0); 476756#L104-1 assume !(0 != main_~p6~0); 476750#L108-1 assume !(0 != main_~p7~0); 476746#L112-1 assume !(0 != main_~p8~0); 476742#L116-1 assume !(0 != main_~p9~0); 476735#L120-1 assume !(0 != main_~p10~0); 476737#L124-1 assume !(0 != main_~p11~0); 476726#L128-1 assume !(0 != main_~p12~0); 476728#L132-1 assume !(0 != main_~p13~0); 476717#L136-1 assume !(0 != main_~p14~0); 476719#L140-1 assume !(0 != main_~p1~0); 476705#L146-1 assume !(0 != main_~p2~0); 476707#L151-1 assume !(0 != main_~p3~0); 476695#L156-1 assume !(0 != main_~p4~0); 476696#L161-1 assume !(0 != main_~p5~0); 476685#L166-1 assume !(0 != main_~p6~0); 476686#L171-1 assume !(0 != main_~p7~0); 476674#L176-1 assume !(0 != main_~p8~0); 476676#L181-1 assume !(0 != main_~p9~0); 476797#L186-1 assume !(0 != main_~p10~0); 476795#L191-1 assume !(0 != main_~p11~0); 476792#L196-1 assume !(0 != main_~p12~0); 476790#L201-1 assume !(0 != main_~p13~0); 476789#L206-1 assume !(0 != main_~p14~0); 475162#L211-1 [2020-10-26 04:29:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:42,658 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2020-10-26 04:29:42,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:42,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756788598] [2020-10-26 04:29:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:42,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:42,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:42,718 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2020-10-26 04:29:42,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:42,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325149349] [2020-10-26 04:29:42,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:42,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:42,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:42,743 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:42,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:29:42,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2020-10-26 04:29:42,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:29:42,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775900584] [2020-10-26 04:29:42,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:29:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:42,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:29:42,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:29:42,773 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:29:43,019 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-26 04:29:43,207 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-26 04:29:43,760 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2020-10-26 04:29:43,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:29:43 BoogieIcfgContainer [2020-10-26 04:29:43,932 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:29:43,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:29:43,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:29:43,934 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:29:43,934 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:26" (3/4) ... [2020-10-26 04:29:43,938 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 04:29:43,999 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 04:29:44,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:29:44,002 INFO L168 Benchmark]: Toolchain (without parser) took 18339.31 ms. Allocated memory was 37.7 MB in the beginning and 10.4 GB in the end (delta: 10.4 GB). Free memory was 20.6 MB in the beginning and 9.0 GB in the end (delta: -9.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2020-10-26 04:29:44,002 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 31.5 MB. Free memory was 15.9 MB in the beginning and 15.8 MB in the end (delta: 43.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:29:44,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.29 ms. Allocated memory is still 37.7 MB. Free memory was 20.0 MB in the beginning and 17.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:44,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.15 ms. Allocated memory is still 37.7 MB. Free memory was 17.2 MB in the beginning and 15.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:44,004 INFO L168 Benchmark]: Boogie Preprocessor took 36.34 ms. Allocated memory is still 37.7 MB. Free memory was 15.4 MB in the beginning and 21.9 MB in the end (delta: -6.5 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:44,005 INFO L168 Benchmark]: RCFGBuilder took 859.72 ms. Allocated memory was 37.7 MB in the beginning and 50.3 MB in the end (delta: 12.6 MB). Free memory was 21.9 MB in the beginning and 24.2 MB in the end (delta: -2.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:44,006 INFO L168 Benchmark]: BuchiAutomizer took 17021.83 ms. Allocated memory was 50.3 MB in the beginning and 10.4 GB in the end (delta: 10.3 GB). Free memory was 24.0 MB in the beginning and 9.0 GB in the end (delta: -9.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2020-10-26 04:29:44,006 INFO L168 Benchmark]: Witness Printer took 66.65 ms. Allocated memory is still 10.4 GB. Free memory was 9.0 GB in the beginning and 9.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:29:44,010 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.16 ms. Allocated memory is still 31.5 MB. Free memory was 15.9 MB in the beginning and 15.8 MB in the end (delta: 43.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 295.29 ms. Allocated memory is still 37.7 MB. Free memory was 20.0 MB in the beginning and 17.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.15 ms. Allocated memory is still 37.7 MB. Free memory was 17.2 MB in the beginning and 15.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.34 ms. Allocated memory is still 37.7 MB. Free memory was 15.4 MB in the beginning and 21.9 MB in the end (delta: -6.5 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 859.72 ms. Allocated memory was 37.7 MB in the beginning and 50.3 MB in the end (delta: 12.6 MB). Free memory was 21.9 MB in the beginning and 24.2 MB in the end (delta: -2.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 17021.83 ms. Allocated memory was 50.3 MB in the beginning and 10.4 GB in the end (delta: 10.3 GB). Free memory was 24.0 MB in the beginning and 9.0 GB in the end (delta: -9.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. * Witness Printer took 66.65 ms. Allocated memory is still 10.4 GB. Free memory was 9.0 GB in the beginning and 9.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155650 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.9s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 5.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.7s Buchi closure took 0.2s. Biggest automaton had 155650 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1324 SDtfs, 690 SDslu, 833 SDs, 0 SdLazy, 60 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI12 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: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1184} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=1184, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ff538c9=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78eff6b4=0, p14=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c695454=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59fc146c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7069d705=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@364b5167=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72757037=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44c2782=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@629974b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65447403=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=1185, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66ba22e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b983117=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@113cfe6d=0, lk13=0, p13=0, p11=0, lk11=0, cond=11, NULL=1187, NULL=0, NULL=1186, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40f6780e=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79904b08=11, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: 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; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...