./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e21c3699338992ddad7e6d15f4351c8cc3315b0b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 17:39:06,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:39:06,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:39:06,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:39:06,893 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:39:06,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:39:06,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:39:06,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:39:06,895 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:39:06,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:39:06,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:39:06,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:39:06,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:39:06,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:39:06,898 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:39:06,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:39:06,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:39:06,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:39:06,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:39:06,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:39:06,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:39:06,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:39:06,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:39:06,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:39:06,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:39:06,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:39:06,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:39:06,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:39:06,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:39:06,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:39:06,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:39:06,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:39:06,906 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:39:06,906 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:39:06,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:39:06,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:39:06,907 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 17:39:06,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:39:06,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:39:06,915 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 17:39:06,915 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 17:39:06,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:39:06,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:39:06,915 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:39:06,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:39:06,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:39:06,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 17:39:06,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 17:39:06,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 17:39:06,917 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_4b6dd92f-4655-4e12-8594-7d02c867a493/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(G ! call(__VERIFIER_error())) ) 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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-12-01 17:39:06,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:39:06,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:39:06,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:39:06,945 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:39:06,945 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:39:06,946 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-01 17:39:06,981 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/data/538ee8c5e/8e447e6f92bd43c9aa63928646d2d3a7/FLAGb2352be8f [2018-12-01 17:39:07,405 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:39:07,406 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-01 17:39:07,410 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/data/538ee8c5e/8e447e6f92bd43c9aa63928646d2d3a7/FLAGb2352be8f [2018-12-01 17:39:07,418 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/data/538ee8c5e/8e447e6f92bd43c9aa63928646d2d3a7 [2018-12-01 17:39:07,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:39:07,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:39:07,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:39:07,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:39:07,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:39:07,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3163dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07, skipping insertion in model container [2018-12-01 17:39:07,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:39:07,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:39:07,535 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:39:07,537 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:39:07,546 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:39:07,554 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:39:07,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07 WrapperNode [2018-12-01 17:39:07,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:39:07,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:39:07,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:39:07,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:39:07,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:39:07,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:39:07,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:39:07,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:39:07,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... [2018-12-01 17:39:07,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:39:07,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:39:07,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:39:07,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:39:07,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 17:39:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 17:39:07,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 17:39:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:39:07,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:39:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 17:39:07,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 17:39:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-01 17:39:07,639 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-01 17:39:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-01 17:39:07,639 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-01 17:39:07,742 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:39:07,742 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-01 17:39:07,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:07 BoogieIcfgContainer [2018-12-01 17:39:07,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:39:07,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 17:39:07,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 17:39:07,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 17:39:07,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 05:39:07" (1/3) ... [2018-12-01 17:39:07,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb89205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:39:07, skipping insertion in model container [2018-12-01 17:39:07,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:07" (2/3) ... [2018-12-01 17:39:07,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb89205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:39:07, skipping insertion in model container [2018-12-01 17:39:07,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:07" (3/3) ... [2018-12-01 17:39:07,746 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-01 17:39:07,752 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 17:39:07,755 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 17:39:07,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 17:39:07,780 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:39:07,781 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 17:39:07,781 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 17:39:07,781 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 17:39:07,781 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:39:07,781 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:39:07,781 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 17:39:07,781 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:39:07,781 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 17:39:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-01 17:39:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 17:39:07,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:07,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:07,797 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:07,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-01 17:39:07,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:07,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:07,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:07,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:07,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:39:07,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:07,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:07,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:07,910 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-01 17:39:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:07,973 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-01 17:39:07,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:07,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-01 17:39:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:07,982 INFO L225 Difference]: With dead ends: 44 [2018-12-01 17:39:07,982 INFO L226 Difference]: Without dead ends: 30 [2018-12-01 17:39:07,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:39:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-01 17:39:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-01 17:39:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 17:39:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-01 17:39:08,010 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-01 17:39:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:08,011 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-01 17:39:08,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-01 17:39:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 17:39:08,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:08,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:08,012 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:08,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-01 17:39:08,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:08,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:08,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:08,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:08,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:39:08,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:08,041 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-01 17:39:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:08,088 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-01 17:39:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:08,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-01 17:39:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:08,089 INFO L225 Difference]: With dead ends: 36 [2018-12-01 17:39:08,090 INFO L226 Difference]: Without dead ends: 32 [2018-12-01 17:39:08,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:39:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-01 17:39:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-01 17:39:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 17:39:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-01 17:39:08,096 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-01 17:39:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:08,097 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-01 17:39:08,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-01 17:39:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 17:39:08,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:08,098 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:08,098 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:08,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:08,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-01 17:39:08,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:08,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:08,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:39:08,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:08,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:08,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:39:08,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:08,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-01 17:39:08,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 17:39:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 17:39:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:39:08,240 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-12-01 17:39:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:08,343 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-12-01 17:39:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 17:39:08,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-01 17:39:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:08,344 INFO L225 Difference]: With dead ends: 58 [2018-12-01 17:39:08,344 INFO L226 Difference]: Without dead ends: 34 [2018-12-01 17:39:08,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-01 17:39:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-01 17:39:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-01 17:39:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 17:39:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-12-01 17:39:08,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-12-01 17:39:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:08,349 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-01 17:39:08,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 17:39:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-12-01 17:39:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 17:39:08,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:08,350 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:08,350 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:08,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:08,351 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-12-01 17:39:08,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:08,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:08,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:39:08,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:08,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:08,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:39:08,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:08,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-01 17:39:08,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:39:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:39:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:39:08,416 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-12-01 17:39:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:08,472 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-12-01 17:39:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:39:08,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-01 17:39:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:08,473 INFO L225 Difference]: With dead ends: 43 [2018-12-01 17:39:08,473 INFO L226 Difference]: Without dead ends: 39 [2018-12-01 17:39:08,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:39:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-01 17:39:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-01 17:39:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-01 17:39:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-12-01 17:39:08,478 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-12-01 17:39:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:08,478 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-01 17:39:08,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:39:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-12-01 17:39:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 17:39:08,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:08,479 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:08,479 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:08,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-01 17:39:08,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:08,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 17:39:08,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:08,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:08,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 17:39:08,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:08,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-01 17:39:08,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 17:39:08,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 17:39:08,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:39:08,588 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-12-01 17:39:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:08,700 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-12-01 17:39:08,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 17:39:08,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-01 17:39:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:08,701 INFO L225 Difference]: With dead ends: 70 [2018-12-01 17:39:08,702 INFO L226 Difference]: Without dead ends: 39 [2018-12-01 17:39:08,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-01 17:39:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-01 17:39:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-01 17:39:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-01 17:39:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-01 17:39:08,709 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-12-01 17:39:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:08,709 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-01 17:39:08,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 17:39:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-01 17:39:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:39:08,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:08,711 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:08,711 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:08,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-12-01 17:39:08,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:08,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:08,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-01 17:39:08,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:08,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:08,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 17:39:08,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:08,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-01 17:39:08,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 17:39:08,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 17:39:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:39:08,813 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-12-01 17:39:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:08,910 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-12-01 17:39:08,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 17:39:08,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-12-01 17:39:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:08,912 INFO L225 Difference]: With dead ends: 61 [2018-12-01 17:39:08,912 INFO L226 Difference]: Without dead ends: 57 [2018-12-01 17:39:08,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-01 17:39:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-01 17:39:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-12-01 17:39:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 17:39:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-12-01 17:39:08,922 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-12-01 17:39:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:08,922 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-12-01 17:39:08,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 17:39:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-12-01 17:39:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 17:39:08,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:08,924 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:08,924 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:08,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-12-01 17:39:08,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:08,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:08,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:08,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-01 17:39:08,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:08,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:09,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:09,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-01 17:39:09,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:09,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-12-01 17:39:09,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 17:39:09,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 17:39:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:39:09,069 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-12-01 17:39:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:09,160 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-12-01 17:39:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 17:39:09,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-12-01 17:39:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:09,162 INFO L225 Difference]: With dead ends: 71 [2018-12-01 17:39:09,162 INFO L226 Difference]: Without dead ends: 67 [2018-12-01 17:39:09,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-01 17:39:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-01 17:39:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-12-01 17:39:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 17:39:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-12-01 17:39:09,172 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-12-01 17:39:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:09,172 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-12-01 17:39:09,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 17:39:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-12-01 17:39:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-01 17:39:09,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:09,174 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:09,175 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:09,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-12-01 17:39:09,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:09,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:09,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-01 17:39:09,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:09,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:09,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 17:39:09,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 17:39:09,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:09,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-01 17:39:09,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:09,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-01 17:39:09,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-01 17:39:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-01 17:39:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-01 17:39:09,344 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-12-01 17:39:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:09,653 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-12-01 17:39:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-01 17:39:09,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-12-01 17:39:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:09,655 INFO L225 Difference]: With dead ends: 146 [2018-12-01 17:39:09,655 INFO L226 Difference]: Without dead ends: 103 [2018-12-01 17:39:09,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-12-01 17:39:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-01 17:39:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-12-01 17:39:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-01 17:39:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-12-01 17:39:09,671 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-12-01 17:39:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:09,672 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-12-01 17:39:09,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-01 17:39:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-12-01 17:39:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-01 17:39:09,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:09,675 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:09,675 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:09,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2059253460, now seen corresponding path program 1 times [2018-12-01 17:39:09,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:09,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:09,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:09,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:09,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 66 proven. 113 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-12-01 17:39:09,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:09,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:09,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:09,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 29 proven. 176 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-12-01 17:39:09,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:09,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-12-01 17:39:09,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-01 17:39:09,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-01 17:39:09,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-01 17:39:09,909 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-12-01 17:39:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:10,347 INFO L93 Difference]: Finished difference Result 232 states and 520 transitions. [2018-12-01 17:39:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-01 17:39:10,348 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2018-12-01 17:39:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:10,349 INFO L225 Difference]: With dead ends: 232 [2018-12-01 17:39:10,350 INFO L226 Difference]: Without dead ends: 129 [2018-12-01 17:39:10,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-12-01 17:39:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-01 17:39:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-12-01 17:39:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-01 17:39:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-12-01 17:39:10,365 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 135 [2018-12-01 17:39:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:10,365 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-12-01 17:39:10,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-01 17:39:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2018-12-01 17:39:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-12-01 17:39:10,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:10,368 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 18, 18, 18, 16, 14, 14, 14, 14, 14, 14, 14, 13, 9, 9, 9, 9, 9, 9, 9, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:10,368 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:10,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2064464880, now seen corresponding path program 1 times [2018-12-01 17:39:10,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:10,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:10,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:10,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 151 proven. 445 refuted. 0 times theorem prover too weak. 2421 trivial. 0 not checked. [2018-12-01 17:39:10,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:10,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:10,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:10,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 105 proven. 663 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2018-12-01 17:39:10,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:10,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-12-01 17:39:10,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-01 17:39:10,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-01 17:39:10,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-12-01 17:39:10,725 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 18 states. [2018-12-01 17:39:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:11,197 INFO L93 Difference]: Finished difference Result 290 states and 587 transitions. [2018-12-01 17:39:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-01 17:39:11,197 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 323 [2018-12-01 17:39:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:11,200 INFO L225 Difference]: With dead ends: 290 [2018-12-01 17:39:11,200 INFO L226 Difference]: Without dead ends: 179 [2018-12-01 17:39:11,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2018-12-01 17:39:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-01 17:39:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2018-12-01 17:39:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-01 17:39:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 252 transitions. [2018-12-01 17:39:11,214 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 252 transitions. Word has length 323 [2018-12-01 17:39:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:11,214 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 252 transitions. [2018-12-01 17:39:11,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-01 17:39:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 252 transitions. [2018-12-01 17:39:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-12-01 17:39:11,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:11,222 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 30, 30, 29, 26, 18, 18, 18, 18, 18, 18, 18, 15, 15, 15, 15, 15, 15, 15, 14, 8, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:11,222 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:11,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1400582904, now seen corresponding path program 2 times [2018-12-01 17:39:11,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:11,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6167 backedges. 346 proven. 540 refuted. 0 times theorem prover too weak. 5281 trivial. 0 not checked. [2018-12-01 17:39:11,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:11,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:11,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 17:39:11,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 17:39:11,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:11,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6167 backedges. 241 proven. 751 refuted. 0 times theorem prover too weak. 5175 trivial. 0 not checked. [2018-12-01 17:39:11,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:11,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-12-01 17:39:11,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-01 17:39:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-01 17:39:11,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-12-01 17:39:11,648 INFO L87 Difference]: Start difference. First operand 154 states and 252 transitions. Second operand 19 states. [2018-12-01 17:39:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:12,088 INFO L93 Difference]: Finished difference Result 415 states and 873 transitions. [2018-12-01 17:39:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-01 17:39:12,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 464 [2018-12-01 17:39:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:12,091 INFO L225 Difference]: With dead ends: 415 [2018-12-01 17:39:12,091 INFO L226 Difference]: Without dead ends: 260 [2018-12-01 17:39:12,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2018-12-01 17:39:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-01 17:39:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 201. [2018-12-01 17:39:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-01 17:39:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 378 transitions. [2018-12-01 17:39:12,104 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 378 transitions. Word has length 464 [2018-12-01 17:39:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:12,105 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 378 transitions. [2018-12-01 17:39:12,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-01 17:39:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 378 transitions. [2018-12-01 17:39:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-12-01 17:39:12,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:12,107 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 32, 32, 30, 29, 20, 20, 20, 20, 20, 20, 20, 16, 16, 16, 16, 16, 16, 16, 13, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:12,108 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:12,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1373787663, now seen corresponding path program 3 times [2018-12-01 17:39:12,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:12,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:12,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7345 backedges. 460 proven. 678 refuted. 0 times theorem prover too weak. 6207 trivial. 0 not checked. [2018-12-01 17:39:12,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:12,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 17:39:12,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-01 17:39:12,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:12,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7345 backedges. 2308 proven. 31 refuted. 0 times theorem prover too weak. 5006 trivial. 0 not checked. [2018-12-01 17:39:12,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:12,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2018-12-01 17:39:12,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-01 17:39:12,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-01 17:39:12,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-01 17:39:12,476 INFO L87 Difference]: Start difference. First operand 201 states and 378 transitions. Second operand 15 states. [2018-12-01 17:39:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:12,733 INFO L93 Difference]: Finished difference Result 431 states and 907 transitions. [2018-12-01 17:39:12,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 17:39:12,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 504 [2018-12-01 17:39:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:12,737 INFO L225 Difference]: With dead ends: 431 [2018-12-01 17:39:12,737 INFO L226 Difference]: Without dead ends: 238 [2018-12-01 17:39:12,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-12-01 17:39:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-01 17:39:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2018-12-01 17:39:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-01 17:39:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 432 transitions. [2018-12-01 17:39:12,758 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 432 transitions. Word has length 504 [2018-12-01 17:39:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:12,758 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 432 transitions. [2018-12-01 17:39:12,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-01 17:39:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 432 transitions. [2018-12-01 17:39:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-12-01 17:39:12,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:12,763 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 40, 40, 39, 35, 28, 28, 28, 28, 28, 28, 28, 20, 20, 20, 20, 20, 20, 20, 19, 18, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:12,763 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:12,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1258787827, now seen corresponding path program 4 times [2018-12-01 17:39:12,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:12,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:12,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13112 backedges. 412 proven. 1021 refuted. 0 times theorem prover too weak. 11679 trivial. 0 not checked. [2018-12-01 17:39:12,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:12,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:12,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-01 17:39:13,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-01 17:39:13,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:13,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13112 backedges. 381 proven. 1180 refuted. 0 times theorem prover too weak. 11551 trivial. 0 not checked. [2018-12-01 17:39:13,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:13,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-12-01 17:39:13,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-01 17:39:13,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-01 17:39:13,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-12-01 17:39:13,297 INFO L87 Difference]: Start difference. First operand 225 states and 432 transitions. Second operand 20 states. [2018-12-01 17:39:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:13,642 INFO L93 Difference]: Finished difference Result 531 states and 1229 transitions. [2018-12-01 17:39:13,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-01 17:39:13,642 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 663 [2018-12-01 17:39:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:13,645 INFO L225 Difference]: With dead ends: 531 [2018-12-01 17:39:13,645 INFO L226 Difference]: Without dead ends: 216 [2018-12-01 17:39:13,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 654 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2018-12-01 17:39:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-01 17:39:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 203. [2018-12-01 17:39:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-01 17:39:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 355 transitions. [2018-12-01 17:39:13,665 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 355 transitions. Word has length 663 [2018-12-01 17:39:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:13,666 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 355 transitions. [2018-12-01 17:39:13,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-01 17:39:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 355 transitions. [2018-12-01 17:39:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-12-01 17:39:13,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:13,670 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 36, 36, 33, 32, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 14, 12, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:13,670 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:13,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1697736632, now seen corresponding path program 5 times [2018-12-01 17:39:13,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:13,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:13,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8608 backedges. 450 proven. 753 refuted. 0 times theorem prover too weak. 7405 trivial. 0 not checked. [2018-12-01 17:39:13,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:13,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:13,850 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-01 17:39:13,889 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-01 17:39:13,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:13,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8608 backedges. 3698 proven. 4 refuted. 0 times theorem prover too weak. 4906 trivial. 0 not checked. [2018-12-01 17:39:13,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:13,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-01 17:39:13,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 17:39:13,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 17:39:13,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:39:13,986 INFO L87 Difference]: Start difference. First operand 203 states and 355 transitions. Second operand 9 states. [2018-12-01 17:39:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:14,115 INFO L93 Difference]: Finished difference Result 400 states and 758 transitions. [2018-12-01 17:39:14,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:39:14,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 546 [2018-12-01 17:39:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:14,117 INFO L225 Difference]: With dead ends: 400 [2018-12-01 17:39:14,117 INFO L226 Difference]: Without dead ends: 205 [2018-12-01 17:39:14,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-01 17:39:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-01 17:39:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-12-01 17:39:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-01 17:39:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 346 transitions. [2018-12-01 17:39:14,130 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 346 transitions. Word has length 546 [2018-12-01 17:39:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:14,130 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 346 transitions. [2018-12-01 17:39:14,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 17:39:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 346 transitions. [2018-12-01 17:39:14,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-12-01 17:39:14,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:14,133 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 34, 34, 29, 29, 19, 19, 19, 19, 19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 12, 10, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:14,133 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:14,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1675500899, now seen corresponding path program 6 times [2018-12-01 17:39:14,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:14,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:14,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7248 backedges. 773 proven. 643 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2018-12-01 17:39:14,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:14,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:14,334 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-01 17:39:14,400 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-12-01 17:39:14,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:14,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7248 backedges. 2531 proven. 33 refuted. 0 times theorem prover too weak. 4684 trivial. 0 not checked. [2018-12-01 17:39:14,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:14,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2018-12-01 17:39:14,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 17:39:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 17:39:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-01 17:39:14,500 INFO L87 Difference]: Start difference. First operand 203 states and 346 transitions. Second operand 17 states. [2018-12-01 17:39:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:14,786 INFO L93 Difference]: Finished difference Result 427 states and 776 transitions. [2018-12-01 17:39:14,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 17:39:14,786 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 503 [2018-12-01 17:39:14,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:14,788 INFO L225 Difference]: With dead ends: 427 [2018-12-01 17:39:14,788 INFO L226 Difference]: Without dead ends: 234 [2018-12-01 17:39:14,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2018-12-01 17:39:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-01 17:39:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2018-12-01 17:39:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-01 17:39:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 369 transitions. [2018-12-01 17:39:14,799 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 369 transitions. Word has length 503 [2018-12-01 17:39:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:14,799 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 369 transitions. [2018-12-01 17:39:14,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 17:39:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 369 transitions. [2018-12-01 17:39:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-12-01 17:39:14,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:14,801 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 22, 21, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:14,801 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:14,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1544056333, now seen corresponding path program 7 times [2018-12-01 17:39:14,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:14,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:14,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:14,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:14,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 282 proven. 825 refuted. 0 times theorem prover too weak. 2662 trivial. 0 not checked. [2018-12-01 17:39:14,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:14,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:14,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:15,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 247 proven. 519 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-01 17:39:15,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:15,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 21 [2018-12-01 17:39:15,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 17:39:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 17:39:15,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-12-01 17:39:15,131 INFO L87 Difference]: Start difference. First operand 227 states and 369 transitions. Second operand 21 states. [2018-12-01 17:39:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:15,639 INFO L93 Difference]: Finished difference Result 463 states and 768 transitions. [2018-12-01 17:39:15,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-01 17:39:15,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 368 [2018-12-01 17:39:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:15,641 INFO L225 Difference]: With dead ends: 463 [2018-12-01 17:39:15,641 INFO L226 Difference]: Without dead ends: 240 [2018-12-01 17:39:15,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2018-12-01 17:39:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-12-01 17:39:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 206. [2018-12-01 17:39:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-01 17:39:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 294 transitions. [2018-12-01 17:39:15,651 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 294 transitions. Word has length 368 [2018-12-01 17:39:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:15,652 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 294 transitions. [2018-12-01 17:39:15,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 17:39:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 294 transitions. [2018-12-01 17:39:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-01 17:39:15,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:15,653 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 32, 32, 28, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 12, 9, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:15,654 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:15,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash -855799742, now seen corresponding path program 8 times [2018-12-01 17:39:15,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:15,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:15,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:15,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:15,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6091 backedges. 410 proven. 802 refuted. 0 times theorem prover too weak. 4879 trivial. 0 not checked. [2018-12-01 17:39:15,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:15,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:15,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 17:39:15,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 17:39:15,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:15,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6091 backedges. 412 proven. 797 refuted. 0 times theorem prover too weak. 4882 trivial. 0 not checked. [2018-12-01 17:39:16,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:16,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2018-12-01 17:39:16,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-01 17:39:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-01 17:39:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-01 17:39:16,057 INFO L87 Difference]: Start difference. First operand 206 states and 294 transitions. Second operand 16 states. [2018-12-01 17:39:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:16,218 INFO L93 Difference]: Finished difference Result 231 states and 341 transitions. [2018-12-01 17:39:16,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 17:39:16,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 463 [2018-12-01 17:39:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:16,220 INFO L225 Difference]: With dead ends: 231 [2018-12-01 17:39:16,220 INFO L226 Difference]: Without dead ends: 206 [2018-12-01 17:39:16,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 466 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-12-01 17:39:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-01 17:39:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-12-01 17:39:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-01 17:39:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 276 transitions. [2018-12-01 17:39:16,235 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 276 transitions. Word has length 463 [2018-12-01 17:39:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:16,236 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 276 transitions. [2018-12-01 17:39:16,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-01 17:39:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 276 transitions. [2018-12-01 17:39:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-12-01 17:39:16,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:16,239 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:16,239 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:16,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1726451101, now seen corresponding path program 9 times [2018-12-01 17:39:16,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:16,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:16,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:16,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:16,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 608 proven. 1515 refuted. 0 times theorem prover too weak. 5951 trivial. 0 not checked. [2018-12-01 17:39:16,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:16,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:16,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 17:39:16,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-01 17:39:16,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:16,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 631 proven. 526 refuted. 0 times theorem prover too weak. 6917 trivial. 0 not checked. [2018-12-01 17:39:16,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:16,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 25 [2018-12-01 17:39:16,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-01 17:39:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-01 17:39:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-12-01 17:39:16,723 INFO L87 Difference]: Start difference. First operand 206 states and 276 transitions. Second operand 25 states. [2018-12-01 17:39:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:17,486 INFO L93 Difference]: Finished difference Result 486 states and 716 transitions. [2018-12-01 17:39:17,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-01 17:39:17,487 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 531 [2018-12-01 17:39:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:17,488 INFO L225 Difference]: With dead ends: 486 [2018-12-01 17:39:17,488 INFO L226 Difference]: Without dead ends: 249 [2018-12-01 17:39:17,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=447, Invalid=2859, Unknown=0, NotChecked=0, Total=3306 [2018-12-01 17:39:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-12-01 17:39:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 199. [2018-12-01 17:39:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-01 17:39:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 270 transitions. [2018-12-01 17:39:17,498 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 270 transitions. Word has length 531 [2018-12-01 17:39:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:17,498 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 270 transitions. [2018-12-01 17:39:17,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-01 17:39:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 270 transitions. [2018-12-01 17:39:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-12-01 17:39:17,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:17,500 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:17,500 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:17,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:17,500 INFO L82 PathProgramCache]: Analyzing trace with hash -515597281, now seen corresponding path program 10 times [2018-12-01 17:39:17,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:17,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:17,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:17,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 385 proven. 976 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-01 17:39:17,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:17,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:17,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-01 17:39:17,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-01 17:39:17,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:17,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 397 proven. 499 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2018-12-01 17:39:17,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:17,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 23 [2018-12-01 17:39:17,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-01 17:39:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-01 17:39:17,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-12-01 17:39:17,893 INFO L87 Difference]: Start difference. First operand 199 states and 270 transitions. Second operand 23 states. [2018-12-01 17:39:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:18,573 INFO L93 Difference]: Finished difference Result 442 states and 629 transitions. [2018-12-01 17:39:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-01 17:39:18,573 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 422 [2018-12-01 17:39:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:18,575 INFO L225 Difference]: With dead ends: 442 [2018-12-01 17:39:18,575 INFO L226 Difference]: Without dead ends: 253 [2018-12-01 17:39:18,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=2538, Unknown=0, NotChecked=0, Total=2970 [2018-12-01 17:39:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-01 17:39:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2018-12-01 17:39:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-01 17:39:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2018-12-01 17:39:18,584 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 422 [2018-12-01 17:39:18,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:18,585 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-12-01 17:39:18,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-01 17:39:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2018-12-01 17:39:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-12-01 17:39:18,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:18,587 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 43, 43, 37, 35, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 21, 21, 21, 21, 16, 12, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:18,587 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:18,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1481370929, now seen corresponding path program 11 times [2018-12-01 17:39:18,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:18,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10865 backedges. 308 proven. 1565 refuted. 0 times theorem prover too weak. 8992 trivial. 0 not checked. [2018-12-01 17:39:18,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:18,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-01 17:39:18,886 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-12-01 17:39:18,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:18,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10865 backedges. 4351 proven. 70 refuted. 0 times theorem prover too weak. 6444 trivial. 0 not checked. [2018-12-01 17:39:19,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:19,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2018-12-01 17:39:19,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-01 17:39:19,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-01 17:39:19,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-12-01 17:39:19,078 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand 24 states. [2018-12-01 17:39:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:19,489 INFO L93 Difference]: Finished difference Result 406 states and 540 transitions. [2018-12-01 17:39:19,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-01 17:39:19,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 613 [2018-12-01 17:39:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:19,491 INFO L225 Difference]: With dead ends: 406 [2018-12-01 17:39:19,491 INFO L226 Difference]: Without dead ends: 210 [2018-12-01 17:39:19,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2018-12-01 17:39:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-01 17:39:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-12-01 17:39:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-01 17:39:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2018-12-01 17:39:19,506 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 613 [2018-12-01 17:39:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:19,507 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2018-12-01 17:39:19,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-01 17:39:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2018-12-01 17:39:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-12-01 17:39:19,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:19,510 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 34, 33, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 14, 12, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:19,510 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:19,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2122481566, now seen corresponding path program 12 times [2018-12-01 17:39:19,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:19,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:19,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 959 proven. 575 refuted. 0 times theorem prover too weak. 7879 trivial. 0 not checked. [2018-12-01 17:39:19,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:19,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-01 17:39:19,852 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-12-01 17:39:19,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:39:19,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 874 proven. 170 refuted. 0 times theorem prover too weak. 8369 trivial. 0 not checked. [2018-12-01 17:39:19,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:19,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2018-12-01 17:39:19,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 17:39:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 17:39:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-12-01 17:39:19,972 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand 17 states. [2018-12-01 17:39:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:20,122 INFO L93 Difference]: Finished difference Result 217 states and 264 transitions. [2018-12-01 17:39:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 17:39:20,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 572 [2018-12-01 17:39:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:20,124 INFO L225 Difference]: With dead ends: 217 [2018-12-01 17:39:20,124 INFO L226 Difference]: Without dead ends: 195 [2018-12-01 17:39:20,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-12-01 17:39:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-01 17:39:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2018-12-01 17:39:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-01 17:39:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2018-12-01 17:39:20,136 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 572 [2018-12-01 17:39:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:20,136 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2018-12-01 17:39:20,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 17:39:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2018-12-01 17:39:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-12-01 17:39:20,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:20,138 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 23, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:20,139 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:20,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 634662915, now seen corresponding path program 13 times [2018-12-01 17:39:20,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:20,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:20,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:20,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:39:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 547 proven. 151 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2018-12-01 17:39:20,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:20,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 17:39:20,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:20,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 655 proven. 176 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2018-12-01 17:39:20,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:20,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-12-01 17:39:20,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 17:39:20,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 17:39:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-01 17:39:20,379 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand 12 states. [2018-12-01 17:39:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:20,487 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2018-12-01 17:39:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 17:39:20,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 395 [2018-12-01 17:39:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:20,488 INFO L225 Difference]: With dead ends: 187 [2018-12-01 17:39:20,488 INFO L226 Difference]: Without dead ends: 180 [2018-12-01 17:39:20,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-12-01 17:39:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-01 17:39:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-01 17:39:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-01 17:39:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2018-12-01 17:39:20,500 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 395 [2018-12-01 17:39:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:20,500 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2018-12-01 17:39:20,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 17:39:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2018-12-01 17:39:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-01 17:39:20,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:20,502 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:20,503 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:39:20,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 14 times [2018-12-01 17:39:20,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:20,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:39:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:39:20,566 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 17:39:20,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 05:39:20 BoogieIcfgContainer [2018-12-01 17:39:20,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 17:39:20,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:39:20,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:39:20,604 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:39:20,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:07" (3/4) ... [2018-12-01 17:39:20,605 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 17:39:20,661 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4b6dd92f-4655-4e12-8594-7d02c867a493/bin-2019/uautomizer/witness.graphml [2018-12-01 17:39:20,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:39:20,662 INFO L168 Benchmark]: Toolchain (without parser) took 13241.73 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 889.7 MB). Free memory was 956.0 MB in the beginning and 829.7 MB in the end (delta: 126.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-01 17:39:20,663 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:39:20,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.77 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 17:39:20,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:39:20,663 INFO L168 Benchmark]: Boogie Preprocessor took 10.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:39:20,663 INFO L168 Benchmark]: RCFGBuilder took 164.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-01 17:39:20,663 INFO L168 Benchmark]: TraceAbstraction took 12860.70 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 794.8 MB). Free memory was 1.1 GB in the beginning and 851.0 MB in the end (delta: 230.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-01 17:39:20,663 INFO L168 Benchmark]: Witness Printer took 57.79 ms. Allocated memory is still 1.9 GB. Free memory was 851.0 MB in the beginning and 829.7 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-12-01 17:39:20,664 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.77 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 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 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 164.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12860.70 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 794.8 MB). Free memory was 1.1 GB in the beginning and 851.0 MB in the end (delta: 230.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 57.79 ms. Allocated memory is still 1.9 GB. Free memory was 851.0 MB in the beginning and 829.7 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 12.8s OverallTime, 23 OverallIterations, 57 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 736 SDtfs, 1355 SDslu, 5150 SDs, 0 SdLazy, 8151 SolverSat, 1477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7303 GetRequests, 6748 SyntacticMatches, 4 SemanticMatches, 551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3799 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 324 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 14026 NumberOfCodeBlocks, 12464 NumberOfCodeBlocksAsserted, 160 NumberOfCheckSat, 13521 ConstructedInterpolants, 0 QuantifiedInterpolants, 7745741 SizeOfPredicates, 118 NumberOfNonLiveVariables, 11476 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 42 InterpolantComputations, 2 PerfectInterpolantSequences, 171138/187488 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...