./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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_6.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 8a6bc1adbcafb13db44c5d4b4826990150e2f336 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:47:12,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:47:12,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:47:12,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:47:12,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:47:12,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:47:12,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:47:12,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:47:12,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:47:12,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:47:12,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:47:12,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:47:12,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:47:12,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:47:12,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:47:12,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:47:12,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:47:12,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:47:12,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:47:12,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:47:12,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:47:12,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:47:12,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:47:12,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:47:12,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:47:12,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:47:12,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:47:12,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:47:12,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:47:12,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:47:12,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:47:12,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:47:12,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:47:12,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:47:12,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:47:12,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:47:12,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:47:12,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:47:12,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:47:12,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:47:12,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:47:12,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:47:12,786 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:47:12,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:47:12,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:47:12,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:47:12,789 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:47:12,789 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:47:12,789 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:47:12,789 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:47:12,789 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:47:12,790 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:47:12,791 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:47:12,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:47:12,791 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:47:12,792 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:47:12,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:47:12,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:47:12,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:47:12,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:47:12,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:47:12,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:47:12,794 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:47:12,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:47:12,794 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:47:12,794 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:47:12,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:47:12,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:47:12,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:47:12,795 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:47:12,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:47:12,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:47:12,796 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:47:12,796 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:47:12,797 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:47:12,798 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 8a6bc1adbcafb13db44c5d4b4826990150e2f336 [2020-10-20 06:47:13,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:47:13,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:47:13,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:47:13,081 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:47:13,082 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:47:13,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2020-10-20 06:47:13,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a29eb1d4/6e8283b33ad545068ffee78c4f73f909/FLAGa264bf4ac [2020-10-20 06:47:13,628 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:47:13,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2020-10-20 06:47:13,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a29eb1d4/6e8283b33ad545068ffee78c4f73f909/FLAGa264bf4ac [2020-10-20 06:47:13,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a29eb1d4/6e8283b33ad545068ffee78c4f73f909 [2020-10-20 06:47:13,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:47:14,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:47:14,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:14,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:47:14,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:47:14,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:13" (1/1) ... [2020-10-20 06:47:14,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd7fa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14, skipping insertion in model container [2020-10-20 06:47:14,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:47:13" (1/1) ... [2020-10-20 06:47:14,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:47:14,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:47:14,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:14,429 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:47:14,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:47:14,489 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:47:14,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14 WrapperNode [2020-10-20 06:47:14,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:47:14,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:14,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:47:14,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:47:14,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:47:14,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:47:14,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:47:14,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:47:14,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (1/1) ... [2020-10-20 06:47:14,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:47:14,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:47:14,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:47:14,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:47:14,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (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-20 06:47:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:47:14,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:47:14,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:47:14,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:47:14,913 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:47:14,913 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:47:14,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:14 BoogieIcfgContainer [2020-10-20 06:47:14,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:47:14,919 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:47:14,919 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:47:14,924 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:47:14,926 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:14,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:47:13" (1/3) ... [2020-10-20 06:47:14,928 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7607417a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:14, skipping insertion in model container [2020-10-20 06:47:14,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:14,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:47:14" (2/3) ... [2020-10-20 06:47:14,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7607417a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:47:14, skipping insertion in model container [2020-10-20 06:47:14,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:47:14,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:14" (3/3) ... [2020-10-20 06:47:14,932 INFO L373 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2020-10-20 06:47:14,997 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:47:14,998 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:47:14,998 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:47:14,998 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:47:14,999 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:47:14,999 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:47:14,999 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:47:15,000 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:47:15,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-10-20 06:47:15,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-10-20 06:47:15,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,086 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,086 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,086 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:47:15,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-10-20 06:47:15,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-10-20 06:47:15,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,095 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,097 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,113 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 6#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_~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_~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;havoc main_~cond~0; 27#L99-1true [2020-10-20 06:47:15,118 INFO L796 eck$LassoCheckResult]: Loop: 27#L99-1true assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 21#L31true 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; 16#L48true assume 0 != main_~p1~0;main_~lk1~0 := 1; 29#L48-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 18#L52-1true assume !(0 != main_~p3~0); 9#L56-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 4#L60-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 22#L64-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 28#L68-1true assume !(0 != main_~p1~0); 20#L74-1true assume !(0 != main_~p2~0); 30#L79-1true assume !(0 != main_~p3~0); 5#L84-1true assume !(0 != main_~p4~0); 10#L89-1true assume !(0 != main_~p5~0); 17#L94-1true assume !(0 != main_~p6~0); 27#L99-1true [2020-10-20 06:47:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,129 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:47:15,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826260074] [2020-10-20 06:47:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,246 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,288 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2020-10-20 06:47:15,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544640031] [2020-10-20 06:47:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,366 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-20 06:47:15,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544640031] [2020-10-20 06:47:15,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110249125] [2020-10-20 06:47:15,377 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,397 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-10-20 06:47:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,450 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2020-10-20 06:47:15,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2020-10-20 06:47:15,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2020-10-20 06:47:15,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2020-10-20 06:47:15,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-10-20 06:47:15,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-10-20 06:47:15,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2020-10-20 06:47:15,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:15,475 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-10-20 06:47:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2020-10-20 06:47:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-20 06:47:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 06:47:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2020-10-20 06:47:15,508 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-10-20 06:47:15,508 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2020-10-20 06:47:15,508 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:47:15,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2020-10-20 06:47:15,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2020-10-20 06:47:15,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,511 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,511 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,512 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 106#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_~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_~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;havoc main_~cond~0; 97#L99-1 [2020-10-20 06:47:15,512 INFO L796 eck$LassoCheckResult]: Loop: 97#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 104#L31 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; 105#L48 assume !(0 != main_~p1~0); 115#L48-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 100#L52-1 assume !(0 != main_~p3~0); 101#L56-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 117#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 107#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 108#L68-1 assume !(0 != main_~p1~0); 116#L74-1 assume !(0 != main_~p2~0); 127#L79-1 assume !(0 != main_~p3~0); 125#L84-1 assume !(0 != main_~p4~0); 113#L89-1 assume !(0 != main_~p5~0); 96#L94-1 assume !(0 != main_~p6~0); 97#L99-1 [2020-10-20 06:47:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,513 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:47:15,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683968273] [2020-10-20 06:47:15,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,546 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2020-10-20 06:47:15,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772803158] [2020-10-20 06:47:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,579 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-20 06:47:15,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772803158] [2020-10-20 06:47:15,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294239831] [2020-10-20 06:47:15,581 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,583 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand 3 states. [2020-10-20 06:47:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,605 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2020-10-20 06:47:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2020-10-20 06:47:15,610 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2020-10-20 06:47:15,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2020-10-20 06:47:15,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2020-10-20 06:47:15,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2020-10-20 06:47:15,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2020-10-20 06:47:15,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:15,615 INFO L691 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2020-10-20 06:47:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2020-10-20 06:47:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-10-20 06:47:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 06:47:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2020-10-20 06:47:15,627 INFO L714 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2020-10-20 06:47:15,627 INFO L594 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2020-10-20 06:47:15,627 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:47:15,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2020-10-20 06:47:15,630 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2020-10-20 06:47:15,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,631 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,631 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,632 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 229#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_~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_~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;havoc main_~cond~0; 230#L99-1 [2020-10-20 06:47:15,632 INFO L796 eck$LassoCheckResult]: Loop: 230#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 253#L31 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; 250#L48 assume !(0 != main_~p1~0); 248#L48-2 assume !(0 != main_~p2~0); 249#L52-1 assume !(0 != main_~p3~0); 239#L56-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 240#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 232#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 233#L68-1 assume !(0 != main_~p1~0); 270#L74-1 assume !(0 != main_~p2~0); 267#L79-1 assume !(0 != main_~p3~0); 265#L84-1 assume !(0 != main_~p4~0); 261#L89-1 assume !(0 != main_~p5~0); 257#L94-1 assume !(0 != main_~p6~0); 230#L99-1 [2020-10-20 06:47:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:47:15,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815834024] [2020-10-20 06:47:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,672 INFO L82 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2020-10-20 06:47:15,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147055181] [2020-10-20 06:47:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,694 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-20 06:47:15,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147055181] [2020-10-20 06:47:15,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735020491] [2020-10-20 06:47:15,695 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,706 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand 3 states. [2020-10-20 06:47:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,726 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2020-10-20 06:47:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2020-10-20 06:47:15,730 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2020-10-20 06:47:15,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2020-10-20 06:47:15,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2020-10-20 06:47:15,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2020-10-20 06:47:15,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2020-10-20 06:47:15,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:15,735 INFO L691 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2020-10-20 06:47:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2020-10-20 06:47:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-10-20 06:47:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-20 06:47:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2020-10-20 06:47:15,750 INFO L714 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2020-10-20 06:47:15,751 INFO L594 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2020-10-20 06:47:15,751 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:47:15,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2020-10-20 06:47:15,756 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2020-10-20 06:47:15,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,757 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,757 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,758 INFO L794 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 463#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_~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_~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;havoc main_~cond~0; 464#L99-1 [2020-10-20 06:47:15,758 INFO L796 eck$LassoCheckResult]: Loop: 464#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 510#L31 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; 508#L48 assume !(0 != main_~p1~0); 504#L48-2 assume !(0 != main_~p2~0); 502#L52-1 assume !(0 != main_~p3~0); 499#L56-1 assume !(0 != main_~p4~0); 497#L60-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 495#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 492#L68-1 assume !(0 != main_~p1~0); 493#L74-1 assume !(0 != main_~p2~0); 526#L79-1 assume !(0 != main_~p3~0); 521#L84-1 assume !(0 != main_~p4~0); 518#L89-1 assume !(0 != main_~p5~0); 514#L94-1 assume !(0 != main_~p6~0); 464#L99-1 [2020-10-20 06:47:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,759 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 06:47:15,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106745487] [2020-10-20 06:47:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,781 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2020-10-20 06:47:15,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139220125] [2020-10-20 06:47:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:15,809 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-20 06:47:15,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139220125] [2020-10-20 06:47:15,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:15,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:47:15,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484000399] [2020-10-20 06:47:15,811 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:15,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:15,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:15,811 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand 3 states. [2020-10-20 06:47:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:15,833 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2020-10-20 06:47:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:15,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2020-10-20 06:47:15,838 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2020-10-20 06:47:15,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2020-10-20 06:47:15,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2020-10-20 06:47:15,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2020-10-20 06:47:15,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2020-10-20 06:47:15,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:15,846 INFO L691 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2020-10-20 06:47:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2020-10-20 06:47:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-10-20 06:47:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-20 06:47:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2020-10-20 06:47:15,881 INFO L714 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2020-10-20 06:47:15,881 INFO L594 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2020-10-20 06:47:15,881 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:47:15,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2020-10-20 06:47:15,888 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2020-10-20 06:47:15,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:15,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:15,889 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:15,889 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:15,892 INFO L794 eck$LassoCheckResult]: Stem: 917#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 908#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_~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_~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;havoc main_~cond~0; 909#L99-1 [2020-10-20 06:47:15,893 INFO L796 eck$LassoCheckResult]: Loop: 909#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 1046#L31 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; 1044#L48 assume !(0 != main_~p1~0); 1037#L48-2 assume !(0 != main_~p2~0); 1039#L52-1 assume !(0 != main_~p3~0); 1024#L56-1 assume !(0 != main_~p4~0); 1026#L60-1 assume !(0 != main_~p5~0); 1013#L64-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1014#L68-1 assume !(0 != main_~p1~0); 1058#L74-1 assume !(0 != main_~p2~0); 1057#L79-1 assume !(0 != main_~p3~0); 1054#L84-1 assume !(0 != main_~p4~0); 1052#L89-1 assume !(0 != main_~p5~0); 1051#L94-1 assume !(0 != main_~p6~0); 909#L99-1 [2020-10-20 06:47:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,894 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-10-20 06:47:15,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437750823] [2020-10-20 06:47:15,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:15,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:15,959 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2020-10-20 06:47:15,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:15,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466225362] [2020-10-20 06:47:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:47:16,001 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-20 06:47:16,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466225362] [2020-10-20 06:47:16,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:47:16,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:47:16,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486371362] [2020-10-20 06:47:16,004 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:47:16,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:47:16,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:47:16,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:47:16,005 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand 3 states. [2020-10-20 06:47:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:47:16,027 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2020-10-20 06:47:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:47:16,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2020-10-20 06:47:16,033 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2020-10-20 06:47:16,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2020-10-20 06:47:16,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2020-10-20 06:47:16,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2020-10-20 06:47:16,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2020-10-20 06:47:16,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:47:16,044 INFO L691 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2020-10-20 06:47:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2020-10-20 06:47:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-20 06:47:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-20 06:47:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2020-10-20 06:47:16,065 INFO L714 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2020-10-20 06:47:16,066 INFO L594 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2020-10-20 06:47:16,066 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:47:16,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2020-10-20 06:47:16,070 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2020-10-20 06:47:16,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:47:16,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:47:16,071 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:47:16,071 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:47:16,072 INFO L794 eck$LassoCheckResult]: Stem: 1773#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1766#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_~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_~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;havoc main_~cond~0; 1767#L99-1 [2020-10-20 06:47:16,072 INFO L796 eck$LassoCheckResult]: Loop: 1767#L99-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 1923#L31 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; 1919#L48 assume !(0 != main_~p1~0); 1917#L48-2 assume !(0 != main_~p2~0); 1913#L52-1 assume !(0 != main_~p3~0); 1908#L56-1 assume !(0 != main_~p4~0); 1909#L60-1 assume !(0 != main_~p5~0); 1939#L64-1 assume !(0 != main_~p6~0); 1936#L68-1 assume !(0 != main_~p1~0); 1934#L74-1 assume !(0 != main_~p2~0); 1933#L79-1 assume !(0 != main_~p3~0); 1840#L84-1 assume !(0 != main_~p4~0); 1842#L89-1 assume !(0 != main_~p5~0); 1927#L94-1 assume !(0 != main_~p6~0); 1767#L99-1 [2020-10-20 06:47:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2020-10-20 06:47:16,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:16,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787266382] [2020-10-20 06:47:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,094 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2020-10-20 06:47:16,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:16,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192101027] [2020-10-20 06:47:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,108 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:16,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:47:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2020-10-20 06:47:16,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:47:16,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036927635] [2020-10-20 06:47:16,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:47:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:47:16,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:47:16,137 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:47:16,448 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-10-20 06:47:16,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:47:16 BoogieIcfgContainer [2020-10-20 06:47:16,582 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:47:16,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:47:16,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:47:16,584 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:47:16,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:47:14" (3/4) ... [2020-10-20 06:47:16,588 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:47:16,653 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:47:16,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:47:16,656 INFO L168 Benchmark]: Toolchain (without parser) took 2656.41 ms. Allocated memory was 35.7 MB in the beginning and 51.4 MB in the end (delta: 15.7 MB). Free memory was 16.2 MB in the beginning and 27.8 MB in the end (delta: -11.6 MB). Peak memory consumption was 4.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:16,656 INFO L168 Benchmark]: CDTParser took 1.33 ms. Allocated memory is still 33.6 MB. Free memory was 9.4 MB in the beginning and 9.3 MB in the end (delta: 65.7 kB). Peak memory consumption was 65.7 kB. Max. memory is 14.3 GB. [2020-10-20 06:47:16,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.79 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 15.2 MB in the beginning and 25.4 MB in the end (delta: -10.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:16,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.88 ms. Allocated memory is still 44.0 MB. Free memory was 25.4 MB in the beginning and 23.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:16,659 INFO L168 Benchmark]: Boogie Preprocessor took 28.44 ms. Allocated memory is still 44.0 MB. Free memory was 23.6 MB in the beginning and 22.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:16,659 INFO L168 Benchmark]: RCFGBuilder took 354.05 ms. Allocated memory was 44.0 MB in the beginning and 45.6 MB in the end (delta: 1.6 MB). Free memory was 22.1 MB in the beginning and 17.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:16,660 INFO L168 Benchmark]: BuchiAutomizer took 1663.71 ms. Allocated memory was 45.6 MB in the beginning and 51.4 MB in the end (delta: 5.8 MB). Free memory was 17.4 MB in the beginning and 30.4 MB in the end (delta: -13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:16,661 INFO L168 Benchmark]: Witness Printer took 70.63 ms. Allocated memory is still 51.4 MB. Free memory was 30.4 MB in the beginning and 27.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:47:16,667 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33 ms. Allocated memory is still 33.6 MB. Free memory was 9.4 MB in the beginning and 9.3 MB in the end (delta: 65.7 kB). Peak memory consumption was 65.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 485.79 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 15.2 MB in the beginning and 25.4 MB in the end (delta: -10.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 41.88 ms. Allocated memory is still 44.0 MB. Free memory was 25.4 MB in the beginning and 23.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 28.44 ms. Allocated memory is still 44.0 MB. Free memory was 23.6 MB in the beginning and 22.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 354.05 ms. Allocated memory was 44.0 MB in the beginning and 45.6 MB in the end (delta: 1.6 MB). Free memory was 22.1 MB in the beginning and 17.4 MB in the end (delta: 4.7 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 1663.71 ms. Allocated memory was 45.6 MB in the beginning and 51.4 MB in the end (delta: 5.8 MB). Free memory was 17.4 MB in the beginning and 30.4 MB in the end (delta: -13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 14.3 GB. * Witness Printer took 70.63 ms. Allocated memory is still 51.4 MB. Free memory was 30.4 MB in the beginning and 27.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 562 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 562 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 256 SDtfs, 130 SDslu, 149 SDs, 0 SdLazy, 25 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI5 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: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=2, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=1, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59b5da36=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@328fd16c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d3390ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bbb27a9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ca82c82=0, cond=14, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@106092ca=0, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1154d5e8=14, NULL=0, NULL=0, NULL=0, NULL=4, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: 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; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...