./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for termination
Using default analysis
Version 678e0110
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.24-678e011
[2019-11-19 22:22:29,356 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-11-19 22:22:29,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-19 22:22:29,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-19 22:22:29,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-19 22:22:29,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-19 22:22:29,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-19 22:22:29,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-19 22:22:29,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-19 22:22:29,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-19 22:22:29,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-11-19 22:22:29,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-19 22:22:29,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-19 22:22:29,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-19 22:22:29,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-19 22:22:29,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-19 22:22:29,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-19 22:22:29,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-19 22:22:29,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-19 22:22:29,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-19 22:22:29,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-19 22:22:29,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-19 22:22:29,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-11-19 22:22:29,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-19 22:22:29,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-19 22:22:29,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-19 22:22:29,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-19 22:22:29,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-19 22:22:29,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-19 22:22:29,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-19 22:22:29,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-19 22:22:29,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-19 22:22:29,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-19 22:22:29,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-19 22:22:29,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-19 22:22:29,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-19 22:22:29,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-19 22:22:29,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-19 22:22:29,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-19 22:22:29,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-19 22:22:29,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-11-19 22:22:29,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2019-11-19 22:22:29,496 INFO L113 SettingsManager]: Loading preferences was successful
[2019-11-19 22:22:29,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-19 22:22:29,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-11-19 22:22:29,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-11-19 22:22:29,499 INFO L138 SettingsManager]: * Use SBE=true
[2019-11-19 22:22:29,499 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2019-11-19 22:22:29,499 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2019-11-19 22:22:29,499 INFO L138 SettingsManager]: * Use old map elimination=false
[2019-11-19 22:22:29,500 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false
[2019-11-19 22:22:29,500 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true
[2019-11-19 22:22:29,500 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2019-11-19 22:22:29,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-19 22:22:29,501 INFO L138 SettingsManager]: * sizeof long=4
[2019-11-19 22:22:29,501 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2019-11-19 22:22:29,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-11-19 22:22:29,502 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-11-19 22:22:29,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-11-19 22:22:29,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2019-11-19 22:22:29,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2019-11-19 22:22:29,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2019-11-19 22:22:29,503 INFO L138 SettingsManager]: * sizeof long double=12
[2019-11-19 22:22:29,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-11-19 22:22:29,504 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false
[2019-11-19 22:22:29,504 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-11-19 22:22:29,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2019-11-19 22:22:29,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-19 22:22:29,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-11-19 22:22:29,505 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump
[2019-11-19 22:22:29,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-19 22:22:29,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-11-19 22:22:29,506 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto
[2019-11-19 22:22:29,507 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2019-11-19 22:22:29,507 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb
[2019-11-19 22:22:29,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-19 22:22:29,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-19 22:22:29,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-19 22:22:29,905 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-11-19 22:22:29,906 INFO L275 PluginConnector]: CDTParser initialized
[2019-11-19 22:22:29,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c
[2019-11-19 22:22:29,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9a07665/bf7ca6f499f04d828f0508449c7a85fd/FLAG4b1d142a3
[2019-11-19 22:22:30,456 INFO L306 CDTParser]: Found 1 translation units.
[2019-11-19 22:22:30,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c
[2019-11-19 22:22:30,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9a07665/bf7ca6f499f04d828f0508449c7a85fd/FLAG4b1d142a3
[2019-11-19 22:22:30,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9a07665/bf7ca6f499f04d828f0508449c7a85fd
[2019-11-19 22:22:30,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-19 22:22:30,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2019-11-19 22:22:30,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-19 22:22:30,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-19 22:22:30,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-19 22:22:30,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:22:30" (1/1) ...
[2019-11-19 22:22:30,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@271aa457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:30, skipping insertion in model container
[2019-11-19 22:22:30,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:22:30" (1/1) ...
[2019-11-19 22:22:30,819 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-11-19 22:22:30,840 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-11-19 22:22:31,079 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-11-19 22:22:31,084 INFO L188 MainTranslator]: Completed pre-run
[2019-11-19 22:22:31,115 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-11-19 22:22:31,130 INFO L192 MainTranslator]: Completed translation
[2019-11-19 22:22:31,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31 WrapperNode
[2019-11-19 22:22:31,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-19 22:22:31,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-19 22:22:31,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-19 22:22:31,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-19 22:22:31,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-19 22:22:31,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-19 22:22:31,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-19 22:22:31,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-11-19 22:22:31,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
[2019-11-19 22:22:31,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-19 22:22:31,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-19 22:22:31,256 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-11-19 22:22:31,256 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-11-19 22:22:31,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2019-11-19 22:22:31,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-19 22:22:31,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-19 22:22:31,573 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-19 22:22:31,574 INFO L285 CfgBuilder]: Removed 5 assume(true) statements.
[2019-11-19 22:22:31,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:31 BoogieIcfgContainer
[2019-11-19 22:22:31,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-19 22:22:31,577 INFO L113 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2019-11-19 22:22:31,577 INFO L271 PluginConnector]: Initializing BuchiAutomizer...
[2019-11-19 22:22:31,585 INFO L275 PluginConnector]: BuchiAutomizer initialized
[2019-11-19 22:22:31,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2019-11-19 22:22:31,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:22:30" (1/3) ...
[2019-11-19 22:22:31,588 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73f0ab6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:22:31, skipping insertion in model container
[2019-11-19 22:22:31,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2019-11-19 22:22:31,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:31" (2/3) ...
[2019-11-19 22:22:31,589 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73f0ab6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:22:31, skipping insertion in model container
[2019-11-19 22:22:31,590 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2019-11-19 22:22:31,590 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:31" (3/3) ...
[2019-11-19 22:22:31,592 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_5.c
[2019-11-19 22:22:31,659 INFO L356 BuchiCegarLoop]: Interprodecural is true
[2019-11-19 22:22:31,659 INFO L357 BuchiCegarLoop]: Hoare is false
[2019-11-19 22:22:31,660 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2019-11-19 22:22:31,660 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-19 22:22:31,660 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-19 22:22:31,660 INFO L361 BuchiCegarLoop]: Difference is false
[2019-11-19 22:22:31,661 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-19 22:22:31,661 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2019-11-19 22:22:31,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states.
[2019-11-19 22:22:31,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2019-11-19 22:22:31,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2019-11-19 22:22:31,700 INFO L119 BuchiIsEmpty]: Starting construction of run
[2019-11-19 22:22:31,708 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1]
[2019-11-19 22:22:31,708 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 22:22:31,708 INFO L424 BuchiCegarLoop]: ======== Iteration 1============
[2019-11-19 22:22:31,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states.
[2019-11-19 22:22:31,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2019-11-19 22:22:31,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2019-11-19 22:22:31,712 INFO L119 BuchiIsEmpty]: Starting construction of run
[2019-11-19 22:22:31,712 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1]
[2019-11-19 22:22:31,713 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 22:22:31,721 INFO L794 eck$LassoCheckResult]: Stem: 17#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_~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; 9#L83-1true
[2019-11-19 22:22:31,723 INFO L796 eck$LassoCheckResult]: Loop: 9#L83-1true assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 4#L26true 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; 13#L41true assume 0 != main_~p1~0;main_~lk1~0 := 1; 8#L41-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 19#L45-1true assume !(0 != main_~p3~0); 6#L49-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 14#L53-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 22#L57-1true assume !(0 != main_~p1~0); 12#L63-1true assume !(0 != main_~p2~0); 24#L68-1true assume !(0 != main_~p3~0); 10#L73-1true assume !(0 != main_~p4~0); 21#L78-1true assume !(0 != main_~p5~0); 9#L83-1true
[2019-11-19 22:22:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times
[2019-11-19 22:22:31,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:31,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333600666]
[2019-11-19 22:22:31,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:31,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-19 22:22:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1077541325, now seen corresponding path program 1 times
[2019-11-19 22:22:31,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:31,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345823905]
[2019-11-19 22:22:31,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 22:22:31,940 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-19 22:22:31,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345823905]
[2019-11-19 22:22:31,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 22:22:31,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 22:22:31,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444445234]
[2019-11-19 22:22:31,949 INFO L811 eck$LassoCheckResult]: loop already infeasible
[2019-11-19 22:22:31,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 22:22:31,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 22:22:31,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 22:22:31,966 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states.
[2019-11-19 22:22:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 22:22:32,013 INFO L93 Difference]: Finished difference Result 44 states and 69 transitions.
[2019-11-19 22:22:32,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 22:22:32,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 69 transitions.
[2019-11-19 22:22:32,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33
[2019-11-19 22:22:32,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 52 transitions.
[2019-11-19 22:22:32,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34
[2019-11-19 22:22:32,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34
[2019-11-19 22:22:32,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 52 transitions.
[2019-11-19 22:22:32,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2019-11-19 22:22:32,028 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions.
[2019-11-19 22:22:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 52 transitions.
[2019-11-19 22:22:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2019-11-19 22:22:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2019-11-19 22:22:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions.
[2019-11-19 22:22:32,059 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions.
[2019-11-19 22:22:32,059 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions.
[2019-11-19 22:22:32,059 INFO L424 BuchiCegarLoop]: ======== Iteration 2============
[2019-11-19 22:22:32,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 52 transitions.
[2019-11-19 22:22:32,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33
[2019-11-19 22:22:32,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2019-11-19 22:22:32,062 INFO L119 BuchiIsEmpty]: Starting construction of run
[2019-11-19 22:22:32,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1]
[2019-11-19 22:22:32,063 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 22:22:32,063 INFO L794 eck$LassoCheckResult]: Stem: 95#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_~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; 96#L83-1
[2019-11-19 22:22:32,063 INFO L796 eck$LassoCheckResult]: Loop: 96#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 103#L26 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; 102#L41 assume !(0 != main_~p1~0); 84#L41-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 85#L45-1 assume !(0 != main_~p3~0); 101#L49-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 91#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 92#L57-1 assume !(0 != main_~p1~0); 88#L63-1 assume !(0 != main_~p2~0); 81#L68-1 assume !(0 != main_~p3~0); 94#L73-1 assume !(0 != main_~p4~0); 105#L78-1 assume !(0 != main_~p5~0); 96#L83-1
[2019-11-19 22:22:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times
[2019-11-19 22:22:32,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073804663]
[2019-11-19 22:22:32,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-19 22:22:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1470568335, now seen corresponding path program 1 times
[2019-11-19 22:22:32,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792975447]
[2019-11-19 22:22:32,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 22:22:32,107 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-19 22:22:32,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792975447]
[2019-11-19 22:22:32,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 22:22:32,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 22:22:32,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060488782]
[2019-11-19 22:22:32,112 INFO L811 eck$LassoCheckResult]: loop already infeasible
[2019-11-19 22:22:32,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 22:22:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 22:22:32,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 22:22:32,113 INFO L87 Difference]: Start difference. First operand 34 states and 52 transitions. cyclomatic complexity: 20 Second operand 3 states.
[2019-11-19 22:22:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 22:22:32,161 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions.
[2019-11-19 22:22:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 22:22:32,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 97 transitions.
[2019-11-19 22:22:32,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64
[2019-11-19 22:22:32,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 97 transitions.
[2019-11-19 22:22:32,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65
[2019-11-19 22:22:32,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65
[2019-11-19 22:22:32,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 97 transitions.
[2019-11-19 22:22:32,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2019-11-19 22:22:32,181 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions.
[2019-11-19 22:22:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 97 transitions.
[2019-11-19 22:22:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2019-11-19 22:22:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2019-11-19 22:22:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions.
[2019-11-19 22:22:32,199 INFO L711 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions.
[2019-11-19 22:22:32,200 INFO L591 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions.
[2019-11-19 22:22:32,200 INFO L424 BuchiCegarLoop]: ======== Iteration 3============
[2019-11-19 22:22:32,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 97 transitions.
[2019-11-19 22:22:32,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64
[2019-11-19 22:22:32,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2019-11-19 22:22:32,208 INFO L119 BuchiIsEmpty]: Starting construction of run
[2019-11-19 22:22:32,209 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1]
[2019-11-19 22:22:32,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 22:22:32,209 INFO L794 eck$LassoCheckResult]: Stem: 202#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_~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; 203#L83-1
[2019-11-19 22:22:32,209 INFO L796 eck$LassoCheckResult]: Loop: 203#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 212#L26 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; 209#L41 assume !(0 != main_~p1~0); 210#L41-2 assume !(0 != main_~p2~0); 232#L45-1 assume !(0 != main_~p3~0); 231#L49-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 230#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 229#L57-1 assume !(0 != main_~p1~0); 228#L63-1 assume !(0 != main_~p2~0); 225#L68-1 assume !(0 != main_~p3~0); 221#L73-1 assume !(0 != main_~p4~0); 217#L78-1 assume !(0 != main_~p5~0); 203#L83-1
[2019-11-19 22:22:32,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,211 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times
[2019-11-19 22:22:32,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225978094]
[2019-11-19 22:22:32,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-19 22:22:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash -790509965, now seen corresponding path program 1 times
[2019-11-19 22:22:32,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067466283]
[2019-11-19 22:22:32,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 22:22:32,291 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-19 22:22:32,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067466283]
[2019-11-19 22:22:32,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 22:22:32,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 22:22:32,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627042084]
[2019-11-19 22:22:32,295 INFO L811 eck$LassoCheckResult]: loop already infeasible
[2019-11-19 22:22:32,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 22:22:32,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 22:22:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 22:22:32,297 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. cyclomatic complexity: 36 Second operand 3 states.
[2019-11-19 22:22:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 22:22:32,333 INFO L93 Difference]: Finished difference Result 125 states and 181 transitions.
[2019-11-19 22:22:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 22:22:32,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 181 transitions.
[2019-11-19 22:22:32,341 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124
[2019-11-19 22:22:32,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 181 transitions.
[2019-11-19 22:22:32,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125
[2019-11-19 22:22:32,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125
[2019-11-19 22:22:32,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 181 transitions.
[2019-11-19 22:22:32,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2019-11-19 22:22:32,349 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions.
[2019-11-19 22:22:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 181 transitions.
[2019-11-19 22:22:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125.
[2019-11-19 22:22:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states.
[2019-11-19 22:22:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions.
[2019-11-19 22:22:32,372 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions.
[2019-11-19 22:22:32,372 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions.
[2019-11-19 22:22:32,372 INFO L424 BuchiCegarLoop]: ======== Iteration 4============
[2019-11-19 22:22:32,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 181 transitions.
[2019-11-19 22:22:32,374 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124
[2019-11-19 22:22:32,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2019-11-19 22:22:32,376 INFO L119 BuchiIsEmpty]: Starting construction of run
[2019-11-19 22:22:32,376 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1]
[2019-11-19 22:22:32,377 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 22:22:32,377 INFO L794 eck$LassoCheckResult]: Stem: 398#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_~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; 399#L83-1
[2019-11-19 22:22:32,377 INFO L796 eck$LassoCheckResult]: Loop: 399#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 411#L26 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; 412#L41 assume !(0 != main_~p1~0); 460#L41-2 assume !(0 != main_~p2~0); 457#L45-1 assume !(0 != main_~p3~0); 453#L49-1 assume !(0 != main_~p4~0); 449#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 447#L57-1 assume !(0 != main_~p1~0); 445#L63-1 assume !(0 != main_~p2~0); 442#L68-1 assume !(0 != main_~p3~0); 438#L73-1 assume !(0 != main_~p4~0); 439#L78-1 assume !(0 != main_~p5~0); 399#L83-1
[2019-11-19 22:22:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times
[2019-11-19 22:22:32,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673560992]
[2019-11-19 22:22:32,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-19 22:22:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,400 INFO L82 PathProgramCache]: Analyzing trace with hash 984497397, now seen corresponding path program 1 times
[2019-11-19 22:22:32,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387465305]
[2019-11-19 22:22:32,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 22:22:32,420 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-19 22:22:32,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387465305]
[2019-11-19 22:22:32,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 22:22:32,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 22:22:32,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102992351]
[2019-11-19 22:22:32,422 INFO L811 eck$LassoCheckResult]: loop already infeasible
[2019-11-19 22:22:32,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 22:22:32,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 22:22:32,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 22:22:32,423 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. cyclomatic complexity: 64 Second operand 3 states.
[2019-11-19 22:22:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 22:22:32,459 INFO L93 Difference]: Finished difference Result 241 states and 337 transitions.
[2019-11-19 22:22:32,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 22:22:32,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 337 transitions.
[2019-11-19 22:22:32,463 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240
[2019-11-19 22:22:32,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 241 states and 337 transitions.
[2019-11-19 22:22:32,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241
[2019-11-19 22:22:32,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241
[2019-11-19 22:22:32,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 337 transitions.
[2019-11-19 22:22:32,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2019-11-19 22:22:32,470 INFO L688 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions.
[2019-11-19 22:22:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 337 transitions.
[2019-11-19 22:22:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241.
[2019-11-19 22:22:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states.
[2019-11-19 22:22:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 337 transitions.
[2019-11-19 22:22:32,488 INFO L711 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions.
[2019-11-19 22:22:32,489 INFO L591 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions.
[2019-11-19 22:22:32,489 INFO L424 BuchiCegarLoop]: ======== Iteration 5============
[2019-11-19 22:22:32,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 337 transitions.
[2019-11-19 22:22:32,491 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240
[2019-11-19 22:22:32,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2019-11-19 22:22:32,492 INFO L119 BuchiIsEmpty]: Starting construction of run
[2019-11-19 22:22:32,492 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1]
[2019-11-19 22:22:32,492 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 22:22:32,493 INFO L794 eck$LassoCheckResult]: Stem: 770#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_~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; 771#L83-1
[2019-11-19 22:22:32,493 INFO L796 eck$LassoCheckResult]: Loop: 771#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 832#L26 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; 826#L41 assume !(0 != main_~p1~0); 820#L41-2 assume !(0 != main_~p2~0); 814#L45-1 assume !(0 != main_~p3~0); 815#L49-1 assume !(0 != main_~p4~0); 865#L53-1 assume !(0 != main_~p5~0); 864#L57-1 assume !(0 != main_~p1~0); 862#L63-1 assume !(0 != main_~p2~0); 860#L68-1 assume !(0 != main_~p3~0); 857#L73-1 assume !(0 != main_~p4~0); 841#L78-1 assume !(0 != main_~p5~0); 771#L83-1
[2019-11-19 22:22:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times
[2019-11-19 22:22:32,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798371329]
[2019-11-19 22:22:32,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-19 22:22:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1041755699, now seen corresponding path program 1 times
[2019-11-19 22:22:32,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626498048]
[2019-11-19 22:22:32,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,516 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-19 22:22:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 22:22:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash 536197074, now seen corresponding path program 1 times
[2019-11-19 22:22:32,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 22:22:32,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931090028]
[2019-11-19 22:22:32,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 22:22:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 22:22:32,531 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-19 22:22:32,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:22:32 BoogieIcfgContainer
[2019-11-19 22:22:32,692 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2019-11-19 22:22:32,693 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2019-11-19 22:22:32,693 INFO L271 PluginConnector]: Initializing Witness Printer...
[2019-11-19 22:22:32,693 INFO L275 PluginConnector]: Witness Printer initialized
[2019-11-19 22:22:32,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:31" (3/4) ...
[2019-11-19 22:22:32,699 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample
[2019-11-19 22:22:32,769 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2019-11-19 22:22:32,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2019-11-19 22:22:32,775 INFO L168 Benchmark]: Toolchain (without parser) took 1972.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -88.4 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB.
[2019-11-19 22:22:32,776 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 22:22:32,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.80 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2019-11-19 22:22:32,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB.
[2019-11-19 22:22:32,778 INFO L168 Benchmark]: Boogie Preprocessor took 26.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 22:22:32,779 INFO L168 Benchmark]: RCFGBuilder took 321.72 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB.
[2019-11-19 22:22:32,780 INFO L168 Benchmark]: BuchiAutomizer took 1116.02 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: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB.
[2019-11-19 22:22:32,782 INFO L168 Benchmark]: Witness Printer took 76.94 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB.
[2019-11-19 22:22:32,791 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
* CACSL2BoogieTranslator took 331.80 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
* Boogie Procedure Inliner took 94.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB.
* Boogie Preprocessor took 26.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
* RCFGBuilder took 321.72 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB.
* BuchiAutomizer took 1116.02 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: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB.
* Witness Printer took 76.94 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: 6.5 MB). Peak memory consumption was 6.5 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 241 locations.
- StatisticsResult: Timing statistics
BüchiAutomizer plugin needed 1.0s and 5 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 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 241 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 173 SDtfs, 89 SDslu, 96 SDs, 0 SdLazy, 20 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI4 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@34e68d89=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68b594b9=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30c71558=1, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b8ee02c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ddcaed1=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12820542=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...