./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer --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 fc492c809d432e4c3053fa8c39191c1c15ea4eea .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-cad4683 [2019-11-15 20:49:58,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:49:58,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:49:58,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:49:58,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:49:58,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:49:58,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:49:58,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:49:58,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:49:58,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:49:58,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:49:58,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:49:58,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:49:58,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:49:58,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:49:58,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:49:58,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:49:58,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:49:58,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:49:58,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:49:58,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:49:58,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:49:58,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:49:58,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:49:58,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:49:58,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:49:58,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:49:58,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:49:58,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:49:58,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:49:58,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:49:58,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:49:58,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:49:58,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:49:58,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:49:58,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:49:58,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:49:58,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:49:58,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:49:58,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:49:58,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:49:58,282 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:49:58,296 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:49:58,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:49:58,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:49:58,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:49:58,298 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:49:58,298 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:49:58,298 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:49:58,299 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:49:58,299 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:49:58,299 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:49:58,299 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:49:58,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:49:58,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:49:58,300 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:49:58,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:49:58,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:49:58,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:49:58,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:49:58,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:49:58,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:49:58,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:49:58,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:49:58,302 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:49:58,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:49:58,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:49:58,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:49:58,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:49:58,303 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:49:58,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:49:58,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:49:58,304 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:49:58,305 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:49:58,305 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-11-15 20:49:58,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:49:58,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:49:58,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:49:58,343 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:49:58,343 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:49:58,344 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_6.c [2019-11-15 20:49:58,393 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/data/c0a2abb36/42906158131d4f1abc231183f643f0a6/FLAG27874d7d4 [2019-11-15 20:49:58,845 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:49:58,846 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/sv-benchmarks/c/locks/test_locks_6.c [2019-11-15 20:49:58,852 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/data/c0a2abb36/42906158131d4f1abc231183f643f0a6/FLAG27874d7d4 [2019-11-15 20:49:58,865 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/data/c0a2abb36/42906158131d4f1abc231183f643f0a6 [2019-11-15 20:49:58,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:49:58,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:49:58,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:49:58,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:49:58,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:49:58,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:49:58" (1/1) ... [2019-11-15 20:49:58,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2ced30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:58, skipping insertion in model container [2019-11-15 20:49:58,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:49:58" (1/1) ... [2019-11-15 20:49:58,883 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:49:58,903 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:49:59,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:49:59,168 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:49:59,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:49:59,211 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:49:59,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59 WrapperNode [2019-11-15 20:49:59,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:49:59,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:49:59,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:49:59,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:49:59,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:49:59,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:49:59,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:49:59,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:49:59,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... [2019-11-15 20:49:59,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:49:59,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:49:59,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:49:59,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:49:59,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/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 [2019-11-15 20:49:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:49:59,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:49:59,543 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:49:59,543 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 20:49:59,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:49:59 BoogieIcfgContainer [2019-11-15 20:49:59,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:49:59,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:49:59,545 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:49:59,548 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:49:59,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:49:59,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:49:58" (1/3) ... [2019-11-15 20:49:59,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71aeb115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:49:59, skipping insertion in model container [2019-11-15 20:49:59,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:49:59,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:49:59" (2/3) ... [2019-11-15 20:49:59,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71aeb115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:49:59, skipping insertion in model container [2019-11-15 20:49:59,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:49:59,553 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:49:59" (3/3) ... [2019-11-15 20:49:59,562 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2019-11-15 20:49:59,615 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:49:59,615 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:49:59,616 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:49:59,616 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:49:59,616 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:49:59,616 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:49:59,616 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:49:59,617 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:49:59,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-15 20:49:59,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-15 20:49:59,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:49:59,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:49:59,657 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:49:59,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:49:59,658 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:49:59,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-15 20:49:59,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-15 20:49:59,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:49:59,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:49:59,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:49:59,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:49:59,668 INFO L791 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, 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~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 23#L97-1true [2019-11-15 20:49:59,669 INFO L793 eck$LassoCheckResult]: Loop: 23#L97-1true assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 4#L29true 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; 28#L46true assume 0 != main_~p1~0;main_~lk1~0 := 1; 25#L46-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 17#L50-1true assume !(0 != main_~p3~0); 8#L54-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 15#L58-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 5#L62-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 24#L66-1true assume !(0 != main_~p1~0); 19#L72-1true assume !(0 != main_~p2~0); 26#L77-1true assume !(0 != main_~p3~0); 3#L82-1true assume !(0 != main_~p4~0); 9#L87-1true assume !(0 != main_~p5~0); 16#L92-1true assume !(0 != main_~p6~0); 23#L97-1true [2019-11-15 20:49:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:49:59,675 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 20:49:59,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:49:59,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294973371] [2019-11-15 20:49:59,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:49:59,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:49:59,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:49:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:49:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:49:59,758 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:49:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:49:59,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1799400087, now seen corresponding path program 1 times [2019-11-15 20:49:59,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:49:59,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86689203] [2019-11-15 20:49:59,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:49:59,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:49:59,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:49:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:49:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:49:59,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86689203] [2019-11-15 20:49:59,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:49:59,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:49:59,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068679606] [2019-11-15 20:49:59,828 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:49:59,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:49:59,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:49:59,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:49:59,840 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2019-11-15 20:49:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:49:59,880 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2019-11-15 20:49:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:49:59,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 81 transitions. [2019-11-15 20:49:59,885 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-11-15 20:49:59,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 40 states and 62 transitions. [2019-11-15 20:49:59,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-15 20:49:59,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-15 20:49:59,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 62 transitions. [2019-11-15 20:49:59,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:49:59,891 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2019-11-15 20:49:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 62 transitions. [2019-11-15 20:49:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-15 20:49:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 20:49:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 62 transitions. [2019-11-15 20:49:59,915 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2019-11-15 20:49:59,915 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2019-11-15 20:49:59,915 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:49:59,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 62 transitions. [2019-11-15 20:49:59,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-11-15 20:49:59,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:49:59,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:49:59,917 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:49:59,917 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:49:59,917 INFO L791 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, 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~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 86#L97-1 [2019-11-15 20:49:59,918 INFO L793 eck$LassoCheckResult]: Loop: 86#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 98#L29 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; 99#L46 assume !(0 != main_~p1~0); 108#L46-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 124#L50-1 assume !(0 != main_~p3~0); 123#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 122#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 121#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 120#L66-1 assume !(0 != main_~p1~0); 119#L72-1 assume !(0 != main_~p2~0); 117#L77-1 assume !(0 != main_~p3~0); 115#L82-1 assume !(0 != main_~p4~0); 113#L87-1 assume !(0 != main_~p5~0); 85#L92-1 assume !(0 != main_~p6~0); 86#L97-1 [2019-11-15 20:49:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:49:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 20:49:59,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:49:59,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414134682] [2019-11-15 20:49:59,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:49:59,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:49:59,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:49:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:49:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:49:59,927 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:49:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:49:59,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2057565525, now seen corresponding path program 1 times [2019-11-15 20:49:59,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:49:59,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416585245] [2019-11-15 20:49:59,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:49:59,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:49:59,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:49:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:49:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:49:59,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416585245] [2019-11-15 20:49:59,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:49:59,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:49:59,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370701966] [2019-11-15 20:49:59,964 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:49:59,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:49:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:49:59,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:49:59,965 INFO L87 Difference]: Start difference. First operand 40 states and 62 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-15 20:49:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:49:59,985 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2019-11-15 20:49:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:49:59,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 117 transitions. [2019-11-15 20:49:59,989 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2019-11-15 20:49:59,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 117 transitions. [2019-11-15 20:49:59,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2019-11-15 20:49:59,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2019-11-15 20:49:59,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 117 transitions. [2019-11-15 20:49:59,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:49:59,992 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2019-11-15 20:49:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 117 transitions. [2019-11-15 20:49:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-15 20:49:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 20:50:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2019-11-15 20:50:00,000 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2019-11-15 20:50:00,001 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2019-11-15 20:50:00,001 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:50:00,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 117 transitions. [2019-11-15 20:50:00,003 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2019-11-15 20:50:00,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:50:00,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:50:00,004 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:50:00,004 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:00,004 INFO L791 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, 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~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 228#L97-1 [2019-11-15 20:50:00,005 INFO L793 eck$LassoCheckResult]: Loop: 228#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 248#L29 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; 246#L46 assume !(0 != main_~p1~0); 245#L46-2 assume !(0 != main_~p2~0); 244#L50-1 assume !(0 != main_~p3~0); 243#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 242#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 241#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 238#L66-1 assume !(0 != main_~p1~0); 239#L72-1 assume !(0 != main_~p2~0); 256#L77-1 assume !(0 != main_~p3~0); 254#L82-1 assume !(0 != main_~p4~0); 252#L87-1 assume !(0 != main_~p5~0); 250#L92-1 assume !(0 != main_~p6~0); 228#L97-1 [2019-11-15 20:50:00,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,005 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-15 20:50:00,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012798401] [2019-11-15 20:50:00,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,015 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:50:00,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1536337193, now seen corresponding path program 1 times [2019-11-15 20:50:00,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521361734] [2019-11-15 20:50:00,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:50:00,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521361734] [2019-11-15 20:50:00,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:00,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:50:00,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259447502] [2019-11-15 20:50:00,047 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:50:00,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:00,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:50:00,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:50:00,047 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. cyclomatic complexity: 44 Second operand 3 states. [2019-11-15 20:50:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:00,071 INFO L93 Difference]: Finished difference Result 149 states and 221 transitions. [2019-11-15 20:50:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:50:00,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 221 transitions. [2019-11-15 20:50:00,075 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2019-11-15 20:50:00,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 221 transitions. [2019-11-15 20:50:00,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2019-11-15 20:50:00,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2019-11-15 20:50:00,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 221 transitions. [2019-11-15 20:50:00,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:50:00,080 INFO L688 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2019-11-15 20:50:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 221 transitions. [2019-11-15 20:50:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-15 20:50:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 20:50:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2019-11-15 20:50:00,093 INFO L711 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2019-11-15 20:50:00,093 INFO L591 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2019-11-15 20:50:00,093 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:50:00,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 221 transitions. [2019-11-15 20:50:00,095 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2019-11-15 20:50:00,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:50:00,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:50:00,096 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:50:00,096 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:00,097 INFO L791 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, 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~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 460#L97-1 [2019-11-15 20:50:00,097 INFO L793 eck$LassoCheckResult]: Loop: 460#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 493#L29 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; 494#L46 assume !(0 != main_~p1~0); 506#L46-2 assume !(0 != main_~p2~0); 507#L50-1 assume !(0 != main_~p3~0); 476#L54-1 assume !(0 != main_~p4~0); 478#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 544#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 541#L66-1 assume !(0 != main_~p1~0); 537#L72-1 assume !(0 != main_~p2~0); 533#L77-1 assume !(0 != main_~p3~0); 531#L82-1 assume !(0 != main_~p4~0); 525#L87-1 assume !(0 != main_~p5~0); 503#L92-1 assume !(0 != main_~p6~0); 460#L97-1 [2019-11-15 20:50:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-15 20:50:00,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542817394] [2019-11-15 20:50:00,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,105 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:50:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash -856278823, now seen corresponding path program 1 times [2019-11-15 20:50:00,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310227209] [2019-11-15 20:50:00,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:50:00,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310227209] [2019-11-15 20:50:00,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:00,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:50:00,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147297866] [2019-11-15 20:50:00,126 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:50:00,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:50:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:50:00,127 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. cyclomatic complexity: 80 Second operand 3 states. [2019-11-15 20:50:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:00,148 INFO L93 Difference]: Finished difference Result 289 states and 417 transitions. [2019-11-15 20:50:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:50:00,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 417 transitions. [2019-11-15 20:50:00,154 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2019-11-15 20:50:00,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 289 states and 417 transitions. [2019-11-15 20:50:00,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2019-11-15 20:50:00,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2019-11-15 20:50:00,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 417 transitions. [2019-11-15 20:50:00,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:50:00,160 INFO L688 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2019-11-15 20:50:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 417 transitions. [2019-11-15 20:50:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-11-15 20:50:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-15 20:50:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 417 transitions. [2019-11-15 20:50:00,179 INFO L711 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2019-11-15 20:50:00,180 INFO L591 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2019-11-15 20:50:00,180 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:50:00,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 289 states and 417 transitions. [2019-11-15 20:50:00,183 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2019-11-15 20:50:00,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:50:00,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:50:00,184 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:50:00,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:00,184 INFO L791 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, 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~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 903#L97-1 [2019-11-15 20:50:00,185 INFO L793 eck$LassoCheckResult]: Loop: 903#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 952#L29 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; 947#L46 assume !(0 != main_~p1~0); 939#L46-2 assume !(0 != main_~p2~0); 934#L50-1 assume !(0 != main_~p3~0); 929#L54-1 assume !(0 != main_~p4~0); 930#L58-1 assume !(0 != main_~p5~0); 985#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 982#L66-1 assume !(0 != main_~p1~0); 980#L72-1 assume !(0 != main_~p2~0); 977#L77-1 assume !(0 != main_~p3~0); 972#L82-1 assume !(0 != main_~p4~0); 968#L87-1 assume !(0 != main_~p5~0); 963#L92-1 assume !(0 != main_~p6~0); 903#L97-1 [2019-11-15 20:50:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-15 20:50:00,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133950691] [2019-11-15 20:50:00,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,193 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:50:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1665625449, now seen corresponding path program 1 times [2019-11-15 20:50:00,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662969776] [2019-11-15 20:50:00,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:50:00,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662969776] [2019-11-15 20:50:00,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:00,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:50:00,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164478076] [2019-11-15 20:50:00,220 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:50:00,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:00,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:50:00,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:50:00,221 INFO L87 Difference]: Start difference. First operand 289 states and 417 transitions. cyclomatic complexity: 144 Second operand 3 states. [2019-11-15 20:50:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:00,247 INFO L93 Difference]: Finished difference Result 561 states and 785 transitions. [2019-11-15 20:50:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:50:00,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 785 transitions. [2019-11-15 20:50:00,253 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2019-11-15 20:50:00,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 561 states and 785 transitions. [2019-11-15 20:50:00,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2019-11-15 20:50:00,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2019-11-15 20:50:00,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 785 transitions. [2019-11-15 20:50:00,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:50:00,265 INFO L688 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2019-11-15 20:50:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 785 transitions. [2019-11-15 20:50:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-11-15 20:50:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-11-15 20:50:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 785 transitions. [2019-11-15 20:50:00,303 INFO L711 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2019-11-15 20:50:00,303 INFO L591 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2019-11-15 20:50:00,303 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:50:00,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 785 transitions. [2019-11-15 20:50:00,307 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2019-11-15 20:50:00,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:50:00,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:50:00,308 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:50:00,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:00,308 INFO L791 eck$LassoCheckResult]: Stem: 1759#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, 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~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 1760#L97-1 [2019-11-15 20:50:00,308 INFO L793 eck$LassoCheckResult]: Loop: 1760#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 1896#L29 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; 1891#L46 assume !(0 != main_~p1~0); 1883#L46-2 assume !(0 != main_~p2~0); 1882#L50-1 assume !(0 != main_~p3~0); 1880#L54-1 assume !(0 != main_~p4~0); 1877#L58-1 assume !(0 != main_~p5~0); 1874#L62-1 assume !(0 != main_~p6~0); 1870#L66-1 assume !(0 != main_~p1~0); 1868#L72-1 assume !(0 != main_~p2~0); 1867#L77-1 assume !(0 != main_~p3~0); 1835#L82-1 assume !(0 != main_~p4~0); 1837#L87-1 assume !(0 != main_~p5~0); 1858#L92-1 assume !(0 != main_~p6~0); 1760#L97-1 [2019-11-15 20:50:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-15 20:50:00,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935979568] [2019-11-15 20:50:00,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:50:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash 109381913, now seen corresponding path program 1 times [2019-11-15 20:50:00,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921566336] [2019-11-15 20:50:00,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,344 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:50:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash -401152264, now seen corresponding path program 1 times [2019-11-15 20:50:00,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:00,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178115279] [2019-11-15 20:50:00,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:00,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:00,376 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:50:00,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:50:00 BoogieIcfgContainer [2019-11-15 20:50:00,513 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:50:00,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:50:00,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:50:00,514 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:50:00,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:49:59" (3/4) ... [2019-11-15 20:50:00,517 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 20:50:00,570 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_43625f8f-3330-45f0-a084-ed6ec0cfaef3/bin/uautomizer/witness.graphml [2019-11-15 20:50:00,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:50:00,572 INFO L168 Benchmark]: Toolchain (without parser) took 1703.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -109.3 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:00,573 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:50:00,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -218.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:00,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:50:00,575 INFO L168 Benchmark]: Boogie Preprocessor took 18.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:50:00,576 INFO L168 Benchmark]: RCFGBuilder took 282.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:00,576 INFO L168 Benchmark]: BuchiAutomizer took 968.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 80.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:00,577 INFO L168 Benchmark]: Witness Printer took 56.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:50:00,579 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -218.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 282.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 968.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 80.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 11.5 GB. * Witness Printer took 56.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 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 561 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. 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 561 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 251 SDtfs, 130 SDslu, 144 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: 27]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c839db4=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e5e8cf0=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@498b51f6=0, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@397ac734=1, lk6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17c6a72b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d234237=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@433676ed=0, cond=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 27]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L25] int cond; Loop: [L27] COND TRUE 1 [L28] cond = __VERIFIER_nondet_int() [L29] COND FALSE !(cond == 0) [L32] lk1 = 0 [L34] lk2 = 0 [L36] lk3 = 0 [L38] lk4 = 0 [L40] lk5 = 0 [L42] lk6 = 0 [L46] COND FALSE !(p1 != 0) [L50] COND FALSE !(p2 != 0) [L54] COND FALSE !(p3 != 0) [L58] COND FALSE !(p4 != 0) [L62] COND FALSE !(p5 != 0) [L66] COND FALSE !(p6 != 0) [L72] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L82] COND FALSE !(p3 != 0) [L87] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L97] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...