./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-5842f4b [2018-11-18 14:39:59,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:39:59,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:39:59,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:39:59,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:39:59,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:39:59,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:39:59,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:39:59,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:39:59,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:39:59,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:39:59,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:39:59,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:39:59,941 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:39:59,942 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:39:59,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:39:59,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:39:59,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:39:59,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:39:59,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:39:59,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:39:59,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:39:59,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:39:59,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:39:59,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:39:59,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:39:59,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:39:59,954 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:39:59,954 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:39:59,955 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:39:59,955 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:39:59,956 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:39:59,956 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:39:59,956 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:39:59,957 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:39:59,958 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:39:59,958 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 14:39:59,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:39:59,968 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:39:59,969 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:39:59,969 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 14:39:59,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:39:59,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:39:59,970 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:39:59,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:39:59,970 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:39:59,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:39:59,971 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:39:59,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:39:59,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:39:59,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:39:59,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:39:59,971 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:39:59,971 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:39:59,971 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:39:59,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:39:59,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:39:59,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:39:59,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:39:59,972 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:39:59,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:39:59,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:39:59,974 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:39:59,974 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:39:59,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:39:59,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:39:59,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:39:59,975 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_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:00,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:40:00,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:40:00,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:40:00,014 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:40:00,014 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:40:00,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 14:40:00,060 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/data/725a18639/622caa0e78034f25ac94f4cea33a6ab6/FLAG45f3d4794 [2018-11-18 14:40:00,407 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:40:00,407 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 14:40:00,413 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/data/725a18639/622caa0e78034f25ac94f4cea33a6ab6/FLAG45f3d4794 [2018-11-18 14:40:00,827 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/data/725a18639/622caa0e78034f25ac94f4cea33a6ab6 [2018-11-18 14:40:00,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:40:00,831 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 14:40:00,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:40:00,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:40:00,833 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:40:00,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:00,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e013f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00, skipping insertion in model container [2018-11-18 14:40:00,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:00,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:40:00,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:40:00,960 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:40:00,962 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:40:00,973 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:40:00,983 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:40:00,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00 WrapperNode [2018-11-18 14:40:00,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:40:00,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:40:00,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:40:00,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:40:00,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:00,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:00,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:00,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:00,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:00,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:00,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (1/1) ... [2018-11-18 14:40:01,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:40:01,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:40:01,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:40:01,000 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:40:01,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:01,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:40:01,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:40:01,075 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-18 14:40:01,075 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-18 14:40:01,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:40:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 14:40:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 14:40:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-18 14:40:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-18 14:40:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:40:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:40:01,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:40:01,177 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:40:01,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:40:01 BoogieIcfgContainer [2018-11-18 14:40:01,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:40:01,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:40:01,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:40:01,181 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:40:01,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:40:00" (1/3) ... [2018-11-18 14:40:01,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a77040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:40:01, skipping insertion in model container [2018-11-18 14:40:01,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:00" (2/3) ... [2018-11-18 14:40:01,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a77040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:40:01, skipping insertion in model container [2018-11-18 14:40:01,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:40:01" (3/3) ... [2018-11-18 14:40:01,184 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 14:40:01,189 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:40:01,193 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:40:01,202 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:40:01,220 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:40:01,221 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:40:01,221 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:40:01,221 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:40:01,221 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:40:01,221 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:40:01,221 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:40:01,221 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:40:01,221 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:40:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 14:40:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 14:40:01,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:01,235 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:40:01,237 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:01,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-18 14:40:01,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:01,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:01,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:01,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:01,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:40:01,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:40:01,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:40:01,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:40:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:40:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:40:01,386 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-18 14:40:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:01,455 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-18 14:40:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:40:01,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 14:40:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:01,463 INFO L225 Difference]: With dead ends: 44 [2018-11-18 14:40:01,463 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 14:40:01,465 INFO L604 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-11-18 14:40:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 14:40:01,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 14:40:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 14:40:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 14:40:01,493 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-18 14:40:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:01,494 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 14:40:01,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:40:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 14:40:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 14:40:01,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:01,495 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:40:01,496 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:01,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-18 14:40:01,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:01,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:40:01,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:40:01,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:40:01,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:40:01,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:40:01,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:40:01,538 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-18 14:40:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:01,589 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-18 14:40:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:40:01,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 14:40:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:01,590 INFO L225 Difference]: With dead ends: 36 [2018-11-18 14:40:01,590 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 14:40:01,591 INFO L604 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-11-18 14:40:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 14:40:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 14:40:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 14:40:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 14:40:01,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-18 14:40:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:01,597 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 14:40:01,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:40:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 14:40:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 14:40:01,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:01,598 INFO L375 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-11-18 14:40:01,598 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:01,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-18 14:40:01,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:01,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:01,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:01,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:40:01,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:01,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:01,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:40:01,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:01,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-18 14:40:01,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:40:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:40:01,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:40:01,795 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-11-18 14:40:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:01,948 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-18 14:40:01,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:40:01,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-18 14:40:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:01,949 INFO L225 Difference]: With dead ends: 58 [2018-11-18 14:40:01,949 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 14:40:01,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-18 14:40:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 14:40:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-18 14:40:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 14:40:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-18 14:40:01,956 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-11-18 14:40:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:01,957 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-18 14:40:01,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:40:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-18 14:40:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 14:40:01,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:01,958 INFO L375 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-11-18 14:40:01,958 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:01,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:01,959 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-18 14:40:01,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:01,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:01,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:01,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:01,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:40:02,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:02,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:02,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:40:02,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:02,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-18 14:40:02,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 14:40:02,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:40:02,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:40:02,050 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-18 14:40:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:02,118 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-18 14:40:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:40:02,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 14:40:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:02,120 INFO L225 Difference]: With dead ends: 43 [2018-11-18 14:40:02,120 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 14:40:02,120 INFO L604 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-11-18 14:40:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 14:40:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-18 14:40:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 14:40:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-18 14:40:02,128 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-11-18 14:40:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:02,128 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-18 14:40:02,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 14:40:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-18 14:40:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 14:40:02,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:02,130 INFO L375 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-11-18 14:40:02,130 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:02,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-18 14:40:02,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:02,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:02,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 14:40:02,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:02,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:02,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:40:02,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:02,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-18 14:40:02,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:40:02,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:40:02,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:40:02,267 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-11-18 14:40:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:02,398 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-11-18 14:40:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:40:02,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-18 14:40:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:02,399 INFO L225 Difference]: With dead ends: 70 [2018-11-18 14:40:02,399 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 14:40:02,400 INFO L604 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-11-18 14:40:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 14:40:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 14:40:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 14:40:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-18 14:40:02,405 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-11-18 14:40:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:02,405 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-18 14:40:02,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:40:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-18 14:40:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 14:40:02,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:02,406 INFO L375 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-11-18 14:40:02,406 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:02,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-11-18 14:40:02,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:02,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:02,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:02,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 14:40:02,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:02,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:02,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 14:40:02,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:02,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-18 14:40:02,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:40:02,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:40:02,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:40:02,518 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-11-18 14:40:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:02,616 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-11-18 14:40:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:40:02,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-18 14:40:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:02,618 INFO L225 Difference]: With dead ends: 61 [2018-11-18 14:40:02,618 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 14:40:02,619 INFO L604 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-11-18 14:40:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 14:40:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-18 14:40:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 14:40:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-11-18 14:40:02,626 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-11-18 14:40:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:02,629 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-18 14:40:02,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:40:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-11-18 14:40:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 14:40:02,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:02,630 INFO L375 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-11-18 14:40:02,631 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:02,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:02,631 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-11-18 14:40:02,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:02,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:02,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 14:40:02,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:02,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:02,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 14:40:02,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:02,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-11-18 14:40:02,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:40:02,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:40:02,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:40:02,760 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-11-18 14:40:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:02,853 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-11-18 14:40:02,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:40:02,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-18 14:40:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:02,854 INFO L225 Difference]: With dead ends: 71 [2018-11-18 14:40:02,854 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 14:40:02,855 INFO L604 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-11-18 14:40:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 14:40:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-18 14:40:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 14:40:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-11-18 14:40:02,862 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-11-18 14:40:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:02,863 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-11-18 14:40:02,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:40:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-11-18 14:40:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 14:40:02,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:02,865 INFO L375 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-11-18 14:40:02,865 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:02,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:02,865 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-11-18 14:40:02,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:02,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:02,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 14:40:02,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:02,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:02,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:40:03,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:40:03,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:40:03,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-18 14:40:03,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:03,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-18 14:40:03,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 14:40:03,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 14:40:03,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-18 14:40:03,114 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-11-18 14:40:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:03,460 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-11-18 14:40:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 14:40:03,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-11-18 14:40:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:03,463 INFO L225 Difference]: With dead ends: 146 [2018-11-18 14:40:03,463 INFO L226 Difference]: Without dead ends: 103 [2018-11-18 14:40:03,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-11-18 14:40:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-18 14:40:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-11-18 14:40:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 14:40:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-11-18 14:40:03,480 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-11-18 14:40:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:03,480 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-11-18 14:40:03,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 14:40:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-11-18 14:40:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 14:40:03,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:03,483 INFO L375 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-11-18 14:40:03,484 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:03,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:03,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2059253460, now seen corresponding path program 1 times [2018-11-18 14:40:03,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:03,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:03,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:03,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:40:03,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 66 proven. 113 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-18 14:40:03,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:03,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:03,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 29 proven. 176 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-18 14:40:03,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:03,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-18 14:40:03,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:40:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:40:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:40:03,820 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-11-18 14:40:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:04,306 INFO L93 Difference]: Finished difference Result 232 states and 520 transitions. [2018-11-18 14:40:04,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 14:40:04,307 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2018-11-18 14:40:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:04,309 INFO L225 Difference]: With dead ends: 232 [2018-11-18 14:40:04,309 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 14:40:04,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 14:40:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 14:40:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-11-18 14:40:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-18 14:40:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-11-18 14:40:04,326 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 135 [2018-11-18 14:40:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:04,326 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-11-18 14:40:04,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:40:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2018-11-18 14:40:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-18 14:40:04,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:04,330 INFO L375 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-11-18 14:40:04,330 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:04,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2064464880, now seen corresponding path program 1 times [2018-11-18 14:40:04,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:04,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:04,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:04,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:04,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:04,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-11-18 14:40:04,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:04,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:04,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:04,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 105 proven. 663 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2018-11-18 14:40:04,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:04,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-11-18 14:40:04,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:40:04,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:40:04,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:40:04,707 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 18 states. [2018-11-18 14:40:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:05,184 INFO L93 Difference]: Finished difference Result 290 states and 587 transitions. [2018-11-18 14:40:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 14:40:05,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 323 [2018-11-18 14:40:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:05,187 INFO L225 Difference]: With dead ends: 290 [2018-11-18 14:40:05,187 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 14:40:05,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 14:40:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 14:40:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2018-11-18 14:40:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-18 14:40:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 252 transitions. [2018-11-18 14:40:05,203 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 252 transitions. Word has length 323 [2018-11-18 14:40:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:05,204 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 252 transitions. [2018-11-18 14:40:05,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:40:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 252 transitions. [2018-11-18 14:40:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-11-18 14:40:05,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:05,210 INFO L375 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-11-18 14:40:05,210 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:05,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:05,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1400582904, now seen corresponding path program 2 times [2018-11-18 14:40:05,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:05,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:05,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:05,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:05,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6167 backedges. 346 proven. 540 refuted. 0 times theorem prover too weak. 5281 trivial. 0 not checked. [2018-11-18 14:40:05,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:05,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:05,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:40:05,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:40:05,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:40:05,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6167 backedges. 241 proven. 751 refuted. 0 times theorem prover too weak. 5175 trivial. 0 not checked. [2018-11-18 14:40:05,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:05,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-18 14:40:05,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 14:40:05,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 14:40:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:40:05,671 INFO L87 Difference]: Start difference. First operand 154 states and 252 transitions. Second operand 19 states. [2018-11-18 14:40:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:06,160 INFO L93 Difference]: Finished difference Result 415 states and 873 transitions. [2018-11-18 14:40:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 14:40:06,160 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 464 [2018-11-18 14:40:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:06,163 INFO L225 Difference]: With dead ends: 415 [2018-11-18 14:40:06,163 INFO L226 Difference]: Without dead ends: 260 [2018-11-18 14:40:06,164 INFO L604 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-11-18 14:40:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-18 14:40:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 201. [2018-11-18 14:40:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 14:40:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 378 transitions. [2018-11-18 14:40:06,183 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 378 transitions. Word has length 464 [2018-11-18 14:40:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:06,183 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 378 transitions. [2018-11-18 14:40:06,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 14:40:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 378 transitions. [2018-11-18 14:40:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-11-18 14:40:06,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:06,187 INFO L375 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-11-18 14:40:06,187 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:06,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:06,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1373787663, now seen corresponding path program 3 times [2018-11-18 14:40:06,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:06,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:06,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:06,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:40:06,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7345 backedges. 460 proven. 678 refuted. 0 times theorem prover too weak. 6207 trivial. 0 not checked. [2018-11-18 14:40:06,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:06,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:06,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:40:06,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 14:40:06,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:40:06,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7345 backedges. 2308 proven. 31 refuted. 0 times theorem prover too weak. 5006 trivial. 0 not checked. [2018-11-18 14:40:06,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:06,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2018-11-18 14:40:06,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 14:40:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 14:40:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:40:06,559 INFO L87 Difference]: Start difference. First operand 201 states and 378 transitions. Second operand 15 states. [2018-11-18 14:40:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:06,790 INFO L93 Difference]: Finished difference Result 431 states and 907 transitions. [2018-11-18 14:40:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 14:40:06,791 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 504 [2018-11-18 14:40:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:06,793 INFO L225 Difference]: With dead ends: 431 [2018-11-18 14:40:06,793 INFO L226 Difference]: Without dead ends: 238 [2018-11-18 14:40:06,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-11-18 14:40:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-18 14:40:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2018-11-18 14:40:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-18 14:40:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 432 transitions. [2018-11-18 14:40:06,812 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 432 transitions. Word has length 504 [2018-11-18 14:40:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:06,812 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 432 transitions. [2018-11-18 14:40:06,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 14:40:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 432 transitions. [2018-11-18 14:40:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-11-18 14:40:06,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:06,817 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 27, 27, 17, 17, 17, 17, 17, 17, 17, 15, 15, 15, 15, 15, 15, 15, 12, 10, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:40:06,817 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:06,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2147330347, now seen corresponding path program 4 times [2018-11-18 14:40:06,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:06,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:06,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:40:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5786 backedges. 337 proven. 458 refuted. 0 times theorem prover too weak. 4991 trivial. 0 not checked. [2018-11-18 14:40:06,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:06,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:06,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:40:07,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:40:07,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:40:07,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5786 backedges. 294 proven. 669 refuted. 0 times theorem prover too weak. 4823 trivial. 0 not checked. [2018-11-18 14:40:07,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:07,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2018-11-18 14:40:07,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 14:40:07,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 14:40:07,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:40:07,185 INFO L87 Difference]: Start difference. First operand 225 states and 432 transitions. Second operand 17 states. [2018-11-18 14:40:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:07,594 INFO L93 Difference]: Finished difference Result 600 states and 1421 transitions. [2018-11-18 14:40:07,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 14:40:07,594 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 451 [2018-11-18 14:40:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:07,599 INFO L225 Difference]: With dead ends: 600 [2018-11-18 14:40:07,600 INFO L226 Difference]: Without dead ends: 386 [2018-11-18 14:40:07,602 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 14:40:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-11-18 14:40:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 268. [2018-11-18 14:40:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-18 14:40:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 542 transitions. [2018-11-18 14:40:07,628 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 542 transitions. Word has length 451 [2018-11-18 14:40:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:07,628 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 542 transitions. [2018-11-18 14:40:07,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 14:40:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 542 transitions. [2018-11-18 14:40:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-11-18 14:40:07,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:07,633 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 34, 34, 34, 30, 24, 24, 24, 24, 24, 24, 24, 17, 17, 17, 17, 17, 17, 17, 17, 15, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:40:07,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:07,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash -155078390, now seen corresponding path program 5 times [2018-11-18 14:40:07,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:07,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:07,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:40:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9592 backedges. 386 proven. 825 refuted. 0 times theorem prover too weak. 8381 trivial. 0 not checked. [2018-11-18 14:40:07,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:07,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:07,929 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 14:40:07,978 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-18 14:40:07,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:40:07,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9592 backedges. 3389 proven. 18 refuted. 0 times theorem prover too weak. 6185 trivial. 0 not checked. [2018-11-18 14:40:08,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:08,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-11-18 14:40:08,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 14:40:08,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 14:40:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:40:08,194 INFO L87 Difference]: Start difference. First operand 268 states and 542 transitions. Second operand 13 states. [2018-11-18 14:40:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:08,435 INFO L93 Difference]: Finished difference Result 511 states and 1136 transitions. [2018-11-18 14:40:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 14:40:08,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 569 [2018-11-18 14:40:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:08,439 INFO L225 Difference]: With dead ends: 511 [2018-11-18 14:40:08,440 INFO L226 Difference]: Without dead ends: 252 [2018-11-18 14:40:08,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 567 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-11-18 14:40:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-18 14:40:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-11-18 14:40:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-18 14:40:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 475 transitions. [2018-11-18 14:40:08,467 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 475 transitions. Word has length 569 [2018-11-18 14:40:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:08,467 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 475 transitions. [2018-11-18 14:40:08,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 14:40:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 475 transitions. [2018-11-18 14:40:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-11-18 14:40:08,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:08,473 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 40, 40, 35, 35, 23, 23, 23, 23, 23, 23, 23, 20, 20, 20, 20, 20, 20, 20, 15, 12, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:40:08,473 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:08,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:08,474 INFO L82 PathProgramCache]: Analyzing trace with hash -299046798, now seen corresponding path program 6 times [2018-11-18 14:40:08,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:08,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:08,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:40:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10406 backedges. 962 proven. 761 refuted. 0 times theorem prover too weak. 8683 trivial. 0 not checked. [2018-11-18 14:40:08,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:08,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:08,751 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 14:40:08,819 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 14:40:08,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:40:08,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10406 backedges. 981 proven. 131 refuted. 0 times theorem prover too weak. 9294 trivial. 0 not checked. [2018-11-18 14:40:08,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:08,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 19 [2018-11-18 14:40:08,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 14:40:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 14:40:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:40:08,974 INFO L87 Difference]: Start difference. First operand 251 states and 475 transitions. Second operand 19 states. [2018-11-18 14:40:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:09,430 INFO L93 Difference]: Finished difference Result 562 states and 1143 transitions. [2018-11-18 14:40:09,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 14:40:09,430 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2018-11-18 14:40:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:09,434 INFO L225 Difference]: With dead ends: 562 [2018-11-18 14:40:09,434 INFO L226 Difference]: Without dead ends: 319 [2018-11-18 14:40:09,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=1310, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 14:40:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-18 14:40:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 261. [2018-11-18 14:40:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-18 14:40:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 460 transitions. [2018-11-18 14:40:09,461 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 460 transitions. Word has length 599 [2018-11-18 14:40:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:09,462 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 460 transitions. [2018-11-18 14:40:09,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 14:40:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 460 transitions. [2018-11-18 14:40:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-18 14:40:09,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:09,465 INFO L375 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-11-18 14:40:09,465 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:09,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash -515597281, now seen corresponding path program 7 times [2018-11-18 14:40:09,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:09,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:09,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:09,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:40:09,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 385 proven. 976 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-11-18 14:40:09,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:09,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:09,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 397 proven. 499 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2018-11-18 14:40:09,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:09,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 23 [2018-11-18 14:40:09,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 14:40:09,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 14:40:09,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-11-18 14:40:09,994 INFO L87 Difference]: Start difference. First operand 261 states and 460 transitions. Second operand 23 states. [2018-11-18 14:40:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:10,741 INFO L93 Difference]: Finished difference Result 525 states and 969 transitions. [2018-11-18 14:40:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-18 14:40:10,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 422 [2018-11-18 14:40:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:10,744 INFO L225 Difference]: With dead ends: 525 [2018-11-18 14:40:10,744 INFO L226 Difference]: Without dead ends: 269 [2018-11-18 14:40:10,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=432, Invalid=2538, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 14:40:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-18 14:40:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 199. [2018-11-18 14:40:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-18 14:40:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 295 transitions. [2018-11-18 14:40:10,758 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 295 transitions. Word has length 422 [2018-11-18 14:40:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:10,758 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 295 transitions. [2018-11-18 14:40:10,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 14:40:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 295 transitions. [2018-11-18 14:40:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2018-11-18 14:40:10,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:10,761 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 50, 50, 42, 41, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 16, 16, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:40:10,761 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:10,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:10,762 INFO L82 PathProgramCache]: Analyzing trace with hash 792643710, now seen corresponding path program 8 times [2018-11-18 14:40:10,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:10,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:10,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:40:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:40:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 1176 proven. 766 refuted. 0 times theorem prover too weak. 12651 trivial. 0 not checked. [2018-11-18 14:40:11,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:40:11,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/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-11-18 14:40:11,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:40:11,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:40:11,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:40:11,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:40:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 655 proven. 1284 refuted. 0 times theorem prover too weak. 12654 trivial. 0 not checked. [2018-11-18 14:40:11,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:40:11,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2018-11-18 14:40:11,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 14:40:11,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 14:40:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:40:11,348 INFO L87 Difference]: Start difference. First operand 199 states and 295 transitions. Second operand 17 states. [2018-11-18 14:40:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:40:11,523 INFO L93 Difference]: Finished difference Result 216 states and 333 transitions. [2018-11-18 14:40:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 14:40:11,523 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 708 [2018-11-18 14:40:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:40:11,525 INFO L225 Difference]: With dead ends: 216 [2018-11-18 14:40:11,525 INFO L226 Difference]: Without dead ends: 199 [2018-11-18 14:40:11,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 710 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-11-18 14:40:11,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-18 14:40:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-18 14:40:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-18 14:40:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 292 transitions. [2018-11-18 14:40:11,544 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 292 transitions. Word has length 708 [2018-11-18 14:40:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:40:11,546 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 292 transitions. [2018-11-18 14:40:11,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 14:40:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 292 transitions. [2018-11-18 14:40:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-18 14:40:11,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:40:11,550 INFO L375 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-11-18 14:40:11,550 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:40:11,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:40:11,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 9 times [2018-11-18 14:40:11,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:40:11,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:40:11,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:11,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:40:11,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:40:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:40:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:40:11,630 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 14:40:11,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:40:11 BoogieIcfgContainer [2018-11-18 14:40:11,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:40:11,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:40:11,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:40:11,677 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:40:11,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:40:01" (3/4) ... [2018-11-18 14:40:11,679 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 14:40:11,747 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8d8a14ed-66a1-4dce-b9b9-efdc00af489b/bin-2019/uautomizer/witness.graphml [2018-11-18 14:40:11,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:40:11,748 INFO L168 Benchmark]: Toolchain (without parser) took 10918.27 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 958.0 MB in the beginning and 1.2 GB in the end (delta: -291.4 MB). Peak memory consumption was 812.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:40:11,750 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:40:11,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:40:11,751 INFO L168 Benchmark]: Boogie Preprocessor took 16.05 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:40:11,751 INFO L168 Benchmark]: RCFGBuilder took 177.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:40:11,751 INFO L168 Benchmark]: TraceAbstraction took 10498.72 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 963.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.4 MB). Peak memory consumption was 840.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:40:11,751 INFO L168 Benchmark]: Witness Printer took 70.49 ms. Allocated memory is still 2.1 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:40:11,752 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.05 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 177.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10498.72 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 963.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.4 MB). Peak memory consumption was 840.7 MB. Max. memory is 11.5 GB. * Witness Printer took 70.49 ms. Allocated memory is still 2.1 GB. Free memory is still 1.2 GB. There was no memory consumed. 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] 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, 10.4s OverallTime, 18 OverallIterations, 53 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 519 SDtfs, 1069 SDslu, 3335 SDs, 0 SdLazy, 5508 SolverSat, 1180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4811 GetRequests, 4414 SyntacticMatches, 4 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2247 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=13, 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, 17 MinimizatonAttempts, 408 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 9372 NumberOfCodeBlocks, 8082 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 8877 ConstructedInterpolants, 0 QuantifiedInterpolants, 5063987 SizeOfPredicates, 84 NumberOfNonLiveVariables, 6979 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 115205/125142 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...