./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version 1dbac8bc
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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.23-1dbac8b
[2018-11-10 00:56:54,859 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-10 00:56:54,860 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-10 00:56:54,868 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-10 00:56:54,868 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-10 00:56:54,869 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-10 00:56:54,870 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-10 00:56:54,871 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-10 00:56:54,872 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-10 00:56:54,872 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-10 00:56:54,873 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-10 00:56:54,873 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-10 00:56:54,874 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-10 00:56:54,874 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-10 00:56:54,875 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-10 00:56:54,875 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-10 00:56:54,876 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-10 00:56:54,877 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-10 00:56:54,878 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-10 00:56:54,879 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-10 00:56:54,880 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-10 00:56:54,881 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-10 00:56:54,882 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-10 00:56:54,882 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-10 00:56:54,882 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-10 00:56:54,883 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-10 00:56:54,884 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-10 00:56:54,884 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-10 00:56:54,885 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-10 00:56:54,885 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-10 00:56:54,886 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-10 00:56:54,886 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-10 00:56:54,886 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-10 00:56:54,886 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-10 00:56:54,887 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-10 00:56:54,887 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-10 00:56:54,888 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf
[2018-11-10 00:56:54,898 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-10 00:56:54,898 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-10 00:56:54,899 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-10 00:56:54,899 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-10 00:56:54,899 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-10 00:56:54,899 INFO  L131        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2018-11-10 00:56:54,899 INFO  L133        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2018-11-10 00:56:54,900 INFO  L133        SettingsManager]:  * Use old map elimination=false
[2018-11-10 00:56:54,900 INFO  L133        SettingsManager]:  * Use external solver (rank synthesis)=false
[2018-11-10 00:56:54,900 INFO  L133        SettingsManager]:  * Use only trivial implications for array writes=true
[2018-11-10 00:56:54,900 INFO  L133        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2018-11-10 00:56:54,900 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-10 00:56:54,900 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-10 00:56:54,900 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-11-10 00:56:54,901 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-10 00:56:54,901 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-10 00:56:54,901 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-10 00:56:54,901 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2018-11-10 00:56:54,901 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2018-11-10 00:56:54,901 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2018-11-10 00:56:54,901 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-10 00:56:54,902 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-10 00:56:54,902 INFO  L133        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2018-11-10 00:56:54,902 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2018-11-10 00:56:54,902 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-10 00:56:54,902 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-10 00:56:54,902 INFO  L133        SettingsManager]:  * To the following directory=/home/matthias/ultimate/dump
[2018-11-10 00:56:54,902 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-10 00:56:54,903 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-10 00:56:54,903 INFO  L133        SettingsManager]:  * Dump automata to the following directory=/home/matthias/ultimate/dump/auto
[2018-11-10 00:56:54,903 INFO  L131        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-11-10 00:56:54,904 INFO  L133        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/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb
[2018-11-10 00:56:54,925 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-10 00:56:54,933 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-10 00:56:54,935 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-10 00:56:54,936 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-10 00:56:54,936 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-10 00:56:54,937 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c
[2018-11-10 00:56:54,972 INFO  L218              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/data/ab43f54db/e36b07b0fd1d4ceea51043d54395da53/FLAG0c4aed0ad
[2018-11-10 00:56:55,365 INFO  L298              CDTParser]: Found 1 translation units.
[2018-11-10 00:56:55,366 INFO  L158              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c
[2018-11-10 00:56:55,371 INFO  L346              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/data/ab43f54db/e36b07b0fd1d4ceea51043d54395da53/FLAG0c4aed0ad
[2018-11-10 00:56:55,380 INFO  L354              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/data/ab43f54db/e36b07b0fd1d4ceea51043d54395da53
[2018-11-10 00:56:55,383 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-10 00:56:55,383 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-10 00:56:55,384 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-10 00:56:55,384 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-10 00:56:55,387 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-10 00:56:55,388 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,390 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56afb46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55, skipping insertion in model container
[2018-11-10 00:56:55,390 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,395 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-10 00:56:55,408 INFO  L174         MainTranslator]: Built tables and reachable declarations
[2018-11-10 00:56:55,507 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-11-10 00:56:55,509 INFO  L189         MainTranslator]: Completed pre-run
[2018-11-10 00:56:55,520 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-11-10 00:56:55,528 INFO  L193         MainTranslator]: Completed translation
[2018-11-10 00:56:55,528 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55 WrapperNode
[2018-11-10 00:56:55,528 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-10 00:56:55,528 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-10 00:56:55,528 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-10 00:56:55,528 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-10 00:56:55,535 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,540 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,554 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-10 00:56:55,554 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-10 00:56:55,555 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-10 00:56:55,555 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-10 00:56:55,562 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,562 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,563 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,563 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,564 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,569 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,569 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
[2018-11-10 00:56:55,571 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-10 00:56:55,571 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-10 00:56:55,571 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-10 00:56:55,571 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-10 00:56:55,572 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/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
[2018-11-10 00:56:55,652 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-10 00:56:55,652 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-10 00:56:55,805 INFO  L341             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-10 00:56:55,806 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:55 BoogieIcfgContainer
[2018-11-10 00:56:55,806 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-10 00:56:55,806 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2018-11-10 00:56:55,807 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2018-11-10 00:56:55,810 INFO  L276        PluginConnector]: BuchiAutomizer initialized
[2018-11-10 00:56:55,811 INFO  L102         BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2018-11-10 00:56:55,811 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:56:55" (1/3) ...
[2018-11-10 00:56:55,812 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@762656be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:56:55, skipping insertion in model container
[2018-11-10 00:56:55,812 INFO  L102         BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2018-11-10 00:56:55,812 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:55" (2/3) ...
[2018-11-10 00:56:55,812 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@762656be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:56:55, skipping insertion in model container
[2018-11-10 00:56:55,812 INFO  L102         BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2018-11-10 00:56:55,813 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:55" (3/3) ...
[2018-11-10 00:56:55,814 INFO  L375   chiAutomizerObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c
[2018-11-10 00:56:55,860 INFO  L135   ementStrategyFactory]: Using default assertion order modulation
[2018-11-10 00:56:55,861 INFO  L374         BuchiCegarLoop]: Interprodecural is true
[2018-11-10 00:56:55,861 INFO  L375         BuchiCegarLoop]: Hoare is false
[2018-11-10 00:56:55,861 INFO  L376         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2018-11-10 00:56:55,861 INFO  L377         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-10 00:56:55,861 INFO  L378         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-10 00:56:55,862 INFO  L379         BuchiCegarLoop]: Difference is false
[2018-11-10 00:56:55,862 INFO  L380         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-10 00:56:55,862 INFO  L383         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2018-11-10 00:56:55,874 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states.
[2018-11-10 00:56:55,893 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 18
[2018-11-10 00:56:55,893 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-10 00:56:55,893 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-10 00:56:55,898 INFO  L866         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2018-11-10 00:56:55,898 INFO  L867         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 00:56:55,898 INFO  L442         BuchiCegarLoop]: ======== Iteration 1============
[2018-11-10 00:56:55,898 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states.
[2018-11-10 00:56:55,900 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 18
[2018-11-10 00:56:55,900 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-10 00:56:55,900 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-10 00:56:55,901 INFO  L866         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2018-11-10 00:56:55,901 INFO  L867         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 00:56:55,906 INFO  L793   eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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_~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;havoc main_~cond~0; 20#L83-1true 
[2018-11-10 00:56:55,907 INFO  L795   eck$LassoCheckResult]: Loop: 20#L83-1true assume true; 25#L24-1true assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 17#L26true assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 22#L41true assume main_~p1~0 != 0;main_~lk1~0 := 1; 19#L41-2true assume main_~p2~0 != 0;main_~lk2~0 := 1; 11#L45-1true assume main_~p3~0 != 0;main_~lk3~0 := 1; 4#L49-1true assume main_~p4~0 != 0;main_~lk4~0 := 1; 7#L53-1true assume main_~p5~0 != 0;main_~lk5~0 := 1; 26#L57-1true assume !(main_~p1~0 != 0); 21#L63-1true assume !(main_~p2~0 != 0); 27#L68-1true assume !(main_~p3~0 != 0); 5#L73-1true assume !(main_~p4~0 != 0); 13#L78-1true assume !(main_~p5~0 != 0); 20#L83-1true 
[2018-11-10 00:56:55,910 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:55,910 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2018-11-10 00:56:55,912 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:55,912 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:55,941 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:55,941 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 00:56:55,942 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:55,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:55,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:55,965 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:55,965 INFO  L82        PathProgramCache]: Analyzing trace with hash 30320665, now seen corresponding path program 1 times
[2018-11-10 00:56:55,965 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:55,965 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:55,966 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:55,966 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 00:56:55,966 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:55,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 00:56:56,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 00:56:56,025 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 00:56:56,026 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 00:56:56,029 INFO  L810   eck$LassoCheckResult]: loop already infeasible
[2018-11-10 00:56:56,038 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 00:56:56,038 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-10 00:56:56,039 INFO  L87              Difference]: Start difference. First operand 25 states. Second operand 3 states.
[2018-11-10 00:56:56,067 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 00:56:56,067 INFO  L93              Difference]: Finished difference Result 47 states and 72 transitions.
[2018-11-10 00:56:56,068 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 00:56:56,069 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 72 transitions.
[2018-11-10 00:56:56,070 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 35
[2018-11-10 00:56:56,073 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 37 states and 55 transitions.
[2018-11-10 00:56:56,074 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 37
[2018-11-10 00:56:56,074 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 37
[2018-11-10 00:56:56,074 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions.
[2018-11-10 00:56:56,075 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-10 00:56:56,075 INFO  L705         BuchiCegarLoop]: Abstraction has 37 states and 55 transitions.
[2018-11-10 00:56:56,085 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions.
[2018-11-10 00:56:56,091 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2018-11-10 00:56:56,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2018-11-10 00:56:56,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions.
[2018-11-10 00:56:56,093 INFO  L728         BuchiCegarLoop]: Abstraction has 37 states and 55 transitions.
[2018-11-10 00:56:56,093 INFO  L608         BuchiCegarLoop]: Abstraction has 37 states and 55 transitions.
[2018-11-10 00:56:56,093 INFO  L442         BuchiCegarLoop]: ======== Iteration 2============
[2018-11-10 00:56:56,093 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions.
[2018-11-10 00:56:56,095 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 35
[2018-11-10 00:56:56,095 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-10 00:56:56,095 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-10 00:56:56,096 INFO  L866         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2018-11-10 00:56:56,096 INFO  L867         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 00:56:56,096 INFO  L793   eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 98#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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_~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;havoc main_~cond~0; 99#L83-1 
[2018-11-10 00:56:56,096 INFO  L795   eck$LassoCheckResult]: Loop: 99#L83-1 assume true; 110#L24-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 109#L26 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 108#L41 assume !(main_~p1~0 != 0); 89#L41-2 assume main_~p2~0 != 0;main_~lk2~0 := 1; 90#L45-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 107#L49-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 106#L53-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 104#L57-1 assume !(main_~p1~0 != 0); 105#L63-1 assume !(main_~p2~0 != 0); 116#L68-1 assume !(main_~p3~0 != 0); 114#L73-1 assume !(main_~p4~0 != 0); 112#L78-1 assume !(main_~p5~0 != 0); 99#L83-1 
[2018-11-10 00:56:56,096 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,096 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times
[2018-11-10 00:56:56,097 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,097 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,097 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,098 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 00:56:56,098 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,100 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,101 INFO  L82        PathProgramCache]: Analyzing trace with hash -362706345, now seen corresponding path program 1 times
[2018-11-10 00:56:56,101 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,101 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,101 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,102 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,102 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 00:56:56,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 00:56:56,117 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 00:56:56,117 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 00:56:56,117 INFO  L810   eck$LassoCheckResult]: loop already infeasible
[2018-11-10 00:56:56,118 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 00:56:56,118 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-10 00:56:56,118 INFO  L87              Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 20 Second operand 3 states.
[2018-11-10 00:56:56,137 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 00:56:56,137 INFO  L93              Difference]: Finished difference Result 70 states and 102 transitions.
[2018-11-10 00:56:56,137 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 00:56:56,138 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 102 transitions.
[2018-11-10 00:56:56,139 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 68
[2018-11-10 00:56:56,139 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 102 transitions.
[2018-11-10 00:56:56,139 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 70
[2018-11-10 00:56:56,140 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 70
[2018-11-10 00:56:56,140 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 70 states and 102 transitions.
[2018-11-10 00:56:56,140 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-10 00:56:56,140 INFO  L705         BuchiCegarLoop]: Abstraction has 70 states and 102 transitions.
[2018-11-10 00:56:56,140 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states and 102 transitions.
[2018-11-10 00:56:56,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2018-11-10 00:56:56,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 70 states.
[2018-11-10 00:56:56,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions.
[2018-11-10 00:56:56,144 INFO  L728         BuchiCegarLoop]: Abstraction has 70 states and 102 transitions.
[2018-11-10 00:56:56,144 INFO  L608         BuchiCegarLoop]: Abstraction has 70 states and 102 transitions.
[2018-11-10 00:56:56,144 INFO  L442         BuchiCegarLoop]: ======== Iteration 3============
[2018-11-10 00:56:56,144 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions.
[2018-11-10 00:56:56,145 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 68
[2018-11-10 00:56:56,145 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-10 00:56:56,145 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-10 00:56:56,145 INFO  L866         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2018-11-10 00:56:56,145 INFO  L867         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 00:56:56,145 INFO  L793   eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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_~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;havoc main_~cond~0; 212#L83-1 
[2018-11-10 00:56:56,146 INFO  L795   eck$LassoCheckResult]: Loop: 212#L83-1 assume true; 228#L24-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 226#L26 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 223#L41 assume !(main_~p1~0 != 0); 224#L41-2 assume !(main_~p2~0 != 0); 251#L45-1 assume main_~p3~0 != 0;main_~lk3~0 := 1; 249#L49-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 247#L53-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 245#L57-1 assume !(main_~p1~0 != 0); 243#L63-1 assume !(main_~p2~0 != 0); 241#L68-1 assume !(main_~p3~0 != 0); 237#L73-1 assume !(main_~p4~0 != 0); 233#L78-1 assume !(main_~p5~0 != 0); 212#L83-1 
[2018-11-10 00:56:56,146 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,146 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times
[2018-11-10 00:56:56,146 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,146 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,146 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,147 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 00:56:56,147 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,149 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,149 INFO  L82        PathProgramCache]: Analyzing trace with hash 317352025, now seen corresponding path program 1 times
[2018-11-10 00:56:56,149 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,149 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,149 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,150 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,150 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 00:56:56,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 00:56:56,166 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 00:56:56,166 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 00:56:56,167 INFO  L810   eck$LassoCheckResult]: loop already infeasible
[2018-11-10 00:56:56,167 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 00:56:56,167 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-10 00:56:56,167 INFO  L87              Difference]: Start difference. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states.
[2018-11-10 00:56:56,185 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 00:56:56,185 INFO  L93              Difference]: Finished difference Result 134 states and 190 transitions.
[2018-11-10 00:56:56,185 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 00:56:56,185 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 190 transitions.
[2018-11-10 00:56:56,187 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 132
[2018-11-10 00:56:56,188 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 190 transitions.
[2018-11-10 00:56:56,188 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 134
[2018-11-10 00:56:56,188 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 134
[2018-11-10 00:56:56,188 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 134 states and 190 transitions.
[2018-11-10 00:56:56,188 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-10 00:56:56,189 INFO  L705         BuchiCegarLoop]: Abstraction has 134 states and 190 transitions.
[2018-11-10 00:56:56,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states and 190 transitions.
[2018-11-10 00:56:56,194 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2018-11-10 00:56:56,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 134 states.
[2018-11-10 00:56:56,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions.
[2018-11-10 00:56:56,196 INFO  L728         BuchiCegarLoop]: Abstraction has 134 states and 190 transitions.
[2018-11-10 00:56:56,196 INFO  L608         BuchiCegarLoop]: Abstraction has 134 states and 190 transitions.
[2018-11-10 00:56:56,196 INFO  L442         BuchiCegarLoop]: ======== Iteration 4============
[2018-11-10 00:56:56,196 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 190 transitions.
[2018-11-10 00:56:56,198 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 132
[2018-11-10 00:56:56,198 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-10 00:56:56,198 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-10 00:56:56,198 INFO  L866         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2018-11-10 00:56:56,198 INFO  L867         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 00:56:56,198 INFO  L793   eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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_~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;havoc main_~cond~0; 422#L83-1 
[2018-11-10 00:56:56,199 INFO  L795   eck$LassoCheckResult]: Loop: 422#L83-1 assume true; 447#L24-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 441#L26 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 442#L41 assume !(main_~p1~0 != 0); 485#L41-2 assume !(main_~p2~0 != 0); 482#L45-1 assume !(main_~p3~0 != 0); 480#L49-1 assume main_~p4~0 != 0;main_~lk4~0 := 1; 478#L53-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 476#L57-1 assume !(main_~p1~0 != 0); 473#L63-1 assume !(main_~p2~0 != 0); 470#L68-1 assume !(main_~p3~0 != 0); 471#L73-1 assume !(main_~p4~0 != 0); 451#L78-1 assume !(main_~p5~0 != 0); 422#L83-1 
[2018-11-10 00:56:56,199 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,199 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times
[2018-11-10 00:56:56,199 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,199 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,200 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,200 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 00:56:56,200 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,203 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,203 INFO  L82        PathProgramCache]: Analyzing trace with hash -491994601, now seen corresponding path program 1 times
[2018-11-10 00:56:56,203 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,203 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,203 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,203 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,203 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 00:56:56,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 00:56:56,222 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 00:56:56,222 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-10 00:56:56,222 INFO  L810   eck$LassoCheckResult]: loop already infeasible
[2018-11-10 00:56:56,223 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 00:56:56,223 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-10 00:56:56,223 INFO  L87              Difference]: Start difference. First operand 134 states and 190 transitions. cyclomatic complexity: 64 Second operand 3 states.
[2018-11-10 00:56:56,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 00:56:56,246 INFO  L93              Difference]: Finished difference Result 258 states and 354 transitions.
[2018-11-10 00:56:56,246 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 00:56:56,246 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 354 transitions.
[2018-11-10 00:56:56,248 INFO  L131   ngComponentsAnalysis]: Automaton has 16 accepting balls. 256
[2018-11-10 00:56:56,250 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 354 transitions.
[2018-11-10 00:56:56,250 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 258
[2018-11-10 00:56:56,251 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 258
[2018-11-10 00:56:56,251 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 258 states and 354 transitions.
[2018-11-10 00:56:56,252 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-10 00:56:56,252 INFO  L705         BuchiCegarLoop]: Abstraction has 258 states and 354 transitions.
[2018-11-10 00:56:56,252 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 258 states and 354 transitions.
[2018-11-10 00:56:56,262 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258.
[2018-11-10 00:56:56,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 258 states.
[2018-11-10 00:56:56,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions.
[2018-11-10 00:56:56,264 INFO  L728         BuchiCegarLoop]: Abstraction has 258 states and 354 transitions.
[2018-11-10 00:56:56,264 INFO  L608         BuchiCegarLoop]: Abstraction has 258 states and 354 transitions.
[2018-11-10 00:56:56,264 INFO  L442         BuchiCegarLoop]: ======== Iteration 5============
[2018-11-10 00:56:56,265 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 354 transitions.
[2018-11-10 00:56:56,266 INFO  L131   ngComponentsAnalysis]: Automaton has 16 accepting balls. 256
[2018-11-10 00:56:56,266 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-10 00:56:56,266 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-10 00:56:56,267 INFO  L866         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2018-11-10 00:56:56,267 INFO  L867         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 00:56:56,267 INFO  L793   eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 822#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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_~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;havoc main_~cond~0; 823#L83-1 
[2018-11-10 00:56:56,267 INFO  L795   eck$LassoCheckResult]: Loop: 823#L83-1 assume true; 894#L24-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 895#L26 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 880#L41 assume !(main_~p1~0 != 0); 882#L41-2 assume !(main_~p2~0 != 0); 860#L45-1 assume !(main_~p3~0 != 0); 862#L49-1 assume !(main_~p4~0 != 0); 929#L53-1 assume main_~p5~0 != 0;main_~lk5~0 := 1; 927#L57-1 assume !(main_~p1~0 != 0); 925#L63-1 assume !(main_~p2~0 != 0); 922#L68-1 assume !(main_~p3~0 != 0); 920#L73-1 assume !(main_~p4~0 != 0); 909#L78-1 assume !(main_~p5~0 != 0); 823#L83-1 
[2018-11-10 00:56:56,267 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,267 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times
[2018-11-10 00:56:56,267 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,267 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,268 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,268 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 00:56:56,268 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,272 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,272 INFO  L82        PathProgramCache]: Analyzing trace with hash 1283012761, now seen corresponding path program 1 times
[2018-11-10 00:56:56,272 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,273 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,273 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,273 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,273 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-10 00:56:56,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-10 00:56:56,291 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-10 00:56:56,291 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-11-10 00:56:56,292 INFO  L810   eck$LassoCheckResult]: loop already infeasible
[2018-11-10 00:56:56,292 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-10 00:56:56,292 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-10 00:56:56,292 INFO  L87              Difference]: Start difference. First operand 258 states and 354 transitions. cyclomatic complexity: 112 Second operand 3 states.
[2018-11-10 00:56:56,311 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-10 00:56:56,312 INFO  L93              Difference]: Finished difference Result 498 states and 658 transitions.
[2018-11-10 00:56:56,312 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-11-10 00:56:56,313 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 658 transitions.
[2018-11-10 00:56:56,316 INFO  L131   ngComponentsAnalysis]: Automaton has 32 accepting balls. 496
[2018-11-10 00:56:56,319 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 498 states and 658 transitions.
[2018-11-10 00:56:56,320 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 498
[2018-11-10 00:56:56,320 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 498
[2018-11-10 00:56:56,321 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 498 states and 658 transitions.
[2018-11-10 00:56:56,323 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-10 00:56:56,323 INFO  L705         BuchiCegarLoop]: Abstraction has 498 states and 658 transitions.
[2018-11-10 00:56:56,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 498 states and 658 transitions.
[2018-11-10 00:56:56,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498.
[2018-11-10 00:56:56,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 498 states.
[2018-11-10 00:56:56,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 658 transitions.
[2018-11-10 00:56:56,338 INFO  L728         BuchiCegarLoop]: Abstraction has 498 states and 658 transitions.
[2018-11-10 00:56:56,338 INFO  L608         BuchiCegarLoop]: Abstraction has 498 states and 658 transitions.
[2018-11-10 00:56:56,338 INFO  L442         BuchiCegarLoop]: ======== Iteration 6============
[2018-11-10 00:56:56,338 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 498 states and 658 transitions.
[2018-11-10 00:56:56,341 INFO  L131   ngComponentsAnalysis]: Automaton has 32 accepting balls. 496
[2018-11-10 00:56:56,341 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-10 00:56:56,341 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-10 00:56:56,341 INFO  L866         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2018-11-10 00:56:56,341 INFO  L867         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-10 00:56:56,343 INFO  L793   eck$LassoCheckResult]: Stem: 1587#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, 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_~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;havoc main_~cond~0; 1584#L83-1 
[2018-11-10 00:56:56,343 INFO  L795   eck$LassoCheckResult]: Loop: 1584#L83-1 assume true; 1785#L24-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 1784#L26 assume !(main_~cond~0 == 0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 1783#L41 assume !(main_~p1~0 != 0); 1781#L41-2 assume !(main_~p2~0 != 0); 1780#L45-1 assume !(main_~p3~0 != 0); 1779#L49-1 assume !(main_~p4~0 != 0); 1777#L53-1 assume !(main_~p5~0 != 0); 1774#L57-1 assume !(main_~p1~0 != 0); 1775#L63-1 assume !(main_~p2~0 != 0); 1790#L68-1 assume !(main_~p3~0 != 0); 1789#L73-1 assume !(main_~p4~0 != 0); 1786#L78-1 assume !(main_~p5~0 != 0); 1584#L83-1 
[2018-11-10 00:56:56,344 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,344 INFO  L82        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times
[2018-11-10 00:56:56,344 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,344 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,345 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,345 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 00:56:56,345 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,347 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,348 INFO  L82        PathProgramCache]: Analyzing trace with hash 1340271063, now seen corresponding path program 1 times
[2018-11-10 00:56:56,348 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,348 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,348 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,348 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,349 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,355 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-10 00:56:56,356 INFO  L82        PathProgramCache]: Analyzing trace with hash 324178261, now seen corresponding path program 1 times
[2018-11-10 00:56:56,356 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-10 00:56:56,356 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-10 00:56:56,356 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,357 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-10 00:56:56,357 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-10 00:56:56,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-10 00:56:56,450 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:56:56 BoogieIcfgContainer
[2018-11-10 00:56:56,450 INFO  L132        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2018-11-10 00:56:56,450 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-10 00:56:56,450 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-10 00:56:56,451 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-10 00:56:56,452 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:55" (3/4) ...
[2018-11-10 00:56:56,455 INFO  L141         WitnessPrinter]: Generating witness for non-termination counterexample
[2018-11-10 00:56:56,493 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_24b6cbd1-e761-4525-ae4d-4f1b001ee90f/bin-2019/uautomizer/witness.graphml
[2018-11-10 00:56:56,493 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-10 00:56:56,494 INFO  L168              Benchmark]: Toolchain (without parser) took 1110.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 960.7 MB in the beginning and 1.1 GB in the end (delta: -91.5 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB.
[2018-11-10 00:56:56,495 INFO  L168              Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-10 00:56:56,495 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 144.18 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 948.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB.
[2018-11-10 00:56:56,495 INFO  L168              Benchmark]: Boogie Procedure Inliner took 25.97 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
[2018-11-10 00:56:56,496 INFO  L168              Benchmark]: Boogie Preprocessor took 16.28 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-10 00:56:56,496 INFO  L168              Benchmark]: RCFGBuilder took 235.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB.
[2018-11-10 00:56:56,496 INFO  L168              Benchmark]: BuchiAutomizer took 643.59 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: 79.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB.
[2018-11-10 00:56:56,497 INFO  L168              Benchmark]: Witness Printer took 42.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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
[2018-11-10 00:56:56,499 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 144.18 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 948.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB.
 * Boogie Procedure Inliner took 25.97 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 16.28 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * RCFGBuilder took 235.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB.
 * BuchiAutomizer took 643.59 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: 79.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB.
 * Witness Printer took 42.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: 2.7 MB). Peak memory consumption was 2.7 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 498 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 0.5s and 6 iterations.  TraceHistogramMax:1. Analysis of lassos took 0.3s. 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 498 states and ocurred in iteration 5.	Nontrivial modules had stage [0, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 227 SDtfs, 114 SDslu, 128 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: 24]: 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, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b66d878=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ad2e248=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4565b96c=1, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cf7ba56=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1efc4ea=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@653a4bb8=0, cond=1}
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 24]: 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;
[L22]        int cond;
Loop:
[L24]  COND TRUE   1
[L25]              cond = __VERIFIER_nondet_int()
[L26]  COND FALSE  !(cond == 0)
[L29]              lk1 = 0
[L31]              lk2 = 0
[L33]              lk3 = 0
[L35]              lk4 = 0
[L37]              lk5 = 0
[L41]  COND FALSE  !(p1 != 0)
[L45]  COND FALSE  !(p2 != 0)
[L49]  COND FALSE  !(p3 != 0)
[L53]  COND FALSE  !(p4 != 0)
[L57]  COND FALSE  !(p5 != 0)
[L63]  COND FALSE  !(p1 != 0)
[L68]  COND FALSE  !(p2 != 0)
[L73]  COND FALSE  !(p3 != 0)
[L78]  COND FALSE  !(p4 != 0)
[L83]  COND FALSE  !(p5 != 0)
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...