./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/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 cd6d4490a7412402195d3193de0347508566f7c8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:32:07,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:32:07,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:32:07,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:32:07,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:32:07,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:32:07,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:32:07,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:32:07,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:32:07,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:32:07,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:32:07,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:32:07,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:32:07,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:32:07,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:32:07,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:32:07,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:32:07,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:32:07,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:32:07,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:32:07,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:32:07,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:32:07,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:32:07,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:32:07,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:32:07,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:32:07,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:32:07,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:32:07,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:32:07,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:32:07,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:32:07,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:32:07,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:32:07,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:32:07,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:32:07,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:32:07,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:32:07,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:32:07,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:32:07,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:32:07,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:32:07,821 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:32:07,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:32:07,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:32:07,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:32:07,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:32:07,836 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:32:07,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:32:07,837 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:32:07,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:32:07,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:32:07,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:32:07,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:32:07,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:32:07,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:32:07,838 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:32:07,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:32:07,839 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:32:07,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:32:07,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:32:07,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:32:07,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:32:07,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:32:07,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:32:07,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:32:07,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:32:07,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:32:07,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:32:07,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:32:07,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:32:07,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> cd6d4490a7412402195d3193de0347508566f7c8 [2019-11-16 00:32:07,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:32:07,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:32:07,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:32:07,883 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:32:07,883 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:32:07,884 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-16 00:32:07,939 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/data/d8e245c63/764dd54df19149a6a525718ab59e4c5a/FLAG01c6c1c20 [2019-11-16 00:32:08,335 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:32:08,337 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2019-11-16 00:32:08,343 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/data/d8e245c63/764dd54df19149a6a525718ab59e4c5a/FLAG01c6c1c20 [2019-11-16 00:32:08,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/data/d8e245c63/764dd54df19149a6a525718ab59e4c5a [2019-11-16 00:32:08,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:32:08,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:32:08,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:08,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:32:08,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:32:08,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d12a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08, skipping insertion in model container [2019-11-16 00:32:08,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,382 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:32:08,401 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:32:08,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:08,636 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:32:08,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:08,672 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:32:08,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08 WrapperNode [2019-11-16 00:32:08,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:08,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:08,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:32:08,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:32:08,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:08,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:32:08,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:32:08,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:32:08,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... [2019-11-16 00:32:08,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:32:08,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:32:08,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:32:08,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:32:08,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/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 [2019-11-16 00:32:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:32:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:32:08,803 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-16 00:32:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-16 00:32:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-16 00:32:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-16 00:32:09,038 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:32:09,039 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:32:09,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:09 BoogieIcfgContainer [2019-11-16 00:32:09,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:32:09,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:32:09,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:32:09,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:32:09,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:32:08" (1/3) ... [2019-11-16 00:32:09,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b73f22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:09, skipping insertion in model container [2019-11-16 00:32:09,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:08" (2/3) ... [2019-11-16 00:32:09,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b73f22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:09, skipping insertion in model container [2019-11-16 00:32:09,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:09" (3/3) ... [2019-11-16 00:32:09,047 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-1.c [2019-11-16 00:32:09,056 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:32:09,065 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:32:09,076 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:32:09,095 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:32:09,095 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:32:09,095 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:32:09,095 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:32:09,095 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:32:09,096 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:32:09,096 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:32:09,096 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:32:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-16 00:32:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:32:09,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:09,117 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:09,118 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-16 00:32:09,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:09,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058869961] [2019-11-16 00:32:09,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:09,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:09,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:09,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058869961] [2019-11-16 00:32:09,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:09,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:32:09,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686506318] [2019-11-16 00:32:09,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:09,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:09,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:09,319 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-11-16 00:32:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:09,414 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-16 00:32:09,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:32:09,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-16 00:32:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:09,425 INFO L225 Difference]: With dead ends: 38 [2019-11-16 00:32:09,425 INFO L226 Difference]: Without dead ends: 26 [2019-11-16 00:32:09,428 INFO L600 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 [2019-11-16 00:32:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-16 00:32:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-16 00:32:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:32:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-16 00:32:09,468 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-16 00:32:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:09,468 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-16 00:32:09,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-16 00:32:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:32:09,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:09,470 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:09,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:09,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-16 00:32:09,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:09,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183522245] [2019-11-16 00:32:09,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:09,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:09,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:09,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183522245] [2019-11-16 00:32:09,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:09,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:32:09,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061082320] [2019-11-16 00:32:09,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:09,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:09,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:09,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:09,523 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-11-16 00:32:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:09,598 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-16 00:32:09,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:32:09,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-16 00:32:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:09,601 INFO L225 Difference]: With dead ends: 32 [2019-11-16 00:32:09,601 INFO L226 Difference]: Without dead ends: 28 [2019-11-16 00:32:09,602 INFO L600 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 [2019-11-16 00:32:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-16 00:32:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-16 00:32:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:32:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-16 00:32:09,609 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-16 00:32:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:09,610 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-16 00:32:09,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-16 00:32:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:32:09,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:09,612 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:09,612 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:09,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:09,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-16 00:32:09,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:09,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708895765] [2019-11-16 00:32:09,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:09,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:09,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:09,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708895765] [2019-11-16 00:32:09,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728333806] [2019-11-16 00:32:09,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:32:09,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:09,861 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:09,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-16 00:32:09,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948571238] [2019-11-16 00:32:09,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:32:09,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:32:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:09,863 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2019-11-16 00:32:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:10,059 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-16 00:32:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:32:10,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-16 00:32:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:10,062 INFO L225 Difference]: With dead ends: 59 [2019-11-16 00:32:10,062 INFO L226 Difference]: Without dead ends: 35 [2019-11-16 00:32:10,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:32:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-16 00:32:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-16 00:32:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:32:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-16 00:32:10,078 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-16 00:32:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:10,079 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-16 00:32:10,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:32:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-16 00:32:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:32:10,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:10,087 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:10,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:10,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:10,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-16 00:32:10,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:10,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396961914] [2019-11-16 00:32:10,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:10,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:10,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:10,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396961914] [2019-11-16 00:32:10,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76669237] [2019-11-16 00:32:10,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:10,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:32:10,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:10,503 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:10,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-16 00:32:10,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559526798] [2019-11-16 00:32:10,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:32:10,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:32:10,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:10,505 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 10 states. [2019-11-16 00:32:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:10,763 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-16 00:32:10,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:32:10,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-16 00:32:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:10,767 INFO L225 Difference]: With dead ends: 55 [2019-11-16 00:32:10,767 INFO L226 Difference]: Without dead ends: 51 [2019-11-16 00:32:10,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:32:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-16 00:32:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-16 00:32:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-16 00:32:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-16 00:32:10,782 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-16 00:32:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:10,782 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-16 00:32:10,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:32:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-16 00:32:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:32:10,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:10,786 INFO L380 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] [2019-11-16 00:32:10,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:10,987 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-16 00:32:10,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:10,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512797387] [2019-11-16 00:32:10,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:10,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:10,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:32:11,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512797387] [2019-11-16 00:32:11,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893008882] [2019-11-16 00:32:11,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:32:11,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:32:11,248 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:11,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-16 00:32:11,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35333981] [2019-11-16 00:32:11,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:32:11,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:11,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:32:11,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:32:11,250 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 12 states. [2019-11-16 00:32:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:11,604 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-16 00:32:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:32:11,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-16 00:32:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:11,608 INFO L225 Difference]: With dead ends: 114 [2019-11-16 00:32:11,609 INFO L226 Difference]: Without dead ends: 68 [2019-11-16 00:32:11,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:32:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-16 00:32:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-16 00:32:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-16 00:32:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-16 00:32:11,639 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-16 00:32:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:11,639 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-16 00:32:11,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:32:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-16 00:32:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:32:11,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:11,642 INFO L380 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] [2019-11-16 00:32:11,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:11,849 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-16 00:32:11,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:11,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796855473] [2019-11-16 00:32:11,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:11,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:11,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:32:11,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796855473] [2019-11-16 00:32:11,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106387040] [2019-11-16 00:32:11,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:32:12,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:32:12,065 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:12,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-16 00:32:12,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102639928] [2019-11-16 00:32:12,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:32:12,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:32:12,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:32:12,067 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 12 states. [2019-11-16 00:32:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:12,342 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-16 00:32:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:32:12,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-16 00:32:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:12,345 INFO L225 Difference]: With dead ends: 147 [2019-11-16 00:32:12,346 INFO L226 Difference]: Without dead ends: 83 [2019-11-16 00:32:12,348 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:32:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-16 00:32:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-16 00:32:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-16 00:32:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-16 00:32:12,367 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-16 00:32:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:12,368 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-16 00:32:12,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:32:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-16 00:32:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:32:12,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:12,371 INFO L380 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] [2019-11-16 00:32:12,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:12,575 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:12,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:12,575 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-16 00:32:12,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:12,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789760712] [2019-11-16 00:32:12,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:12,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:12,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:32:12,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789760712] [2019-11-16 00:32:12,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620699889] [2019-11-16 00:32:12,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:12,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:32:12,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:32:12,922 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:12,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-16 00:32:12,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423276523] [2019-11-16 00:32:12,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:32:12,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:32:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:32:12,923 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 16 states. [2019-11-16 00:32:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:13,446 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-16 00:32:13,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:32:13,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-16 00:32:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:13,450 INFO L225 Difference]: With dead ends: 164 [2019-11-16 00:32:13,450 INFO L226 Difference]: Without dead ends: 100 [2019-11-16 00:32:13,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:32:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-16 00:32:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-16 00:32:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-16 00:32:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-16 00:32:13,476 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-16 00:32:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:13,477 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-16 00:32:13,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:32:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-16 00:32:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:32:13,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:13,481 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:13,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:13,694 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:13,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1894743046, now seen corresponding path program 2 times [2019-11-16 00:32:13,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:13,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474432497] [2019-11-16 00:32:13,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:13,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:13,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:32:13,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474432497] [2019-11-16 00:32:13,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44826002] [2019-11-16 00:32:13,959 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:14,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:32:14,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:14,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:32:14,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 13 proven. 88 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-16 00:32:14,159 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:14,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2019-11-16 00:32:14,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633999264] [2019-11-16 00:32:14,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:32:14,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:32:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:32:14,163 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 19 states. [2019-11-16 00:32:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:14,759 INFO L93 Difference]: Finished difference Result 212 states and 399 transitions. [2019-11-16 00:32:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-16 00:32:14,760 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 90 [2019-11-16 00:32:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:14,762 INFO L225 Difference]: With dead ends: 212 [2019-11-16 00:32:14,762 INFO L226 Difference]: Without dead ends: 107 [2019-11-16 00:32:14,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:32:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-16 00:32:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2019-11-16 00:32:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-16 00:32:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2019-11-16 00:32:14,780 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 90 [2019-11-16 00:32:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:14,780 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2019-11-16 00:32:14,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:32:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2019-11-16 00:32:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-16 00:32:14,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:14,790 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:14,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:15,002 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 735439019, now seen corresponding path program 1 times [2019-11-16 00:32:15,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847770910] [2019-11-16 00:32:15,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 227 proven. 274 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-11-16 00:32:15,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847770910] [2019-11-16 00:32:15,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405902724] [2019-11-16 00:32:15,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:32:15,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 39 proven. 305 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-11-16 00:32:16,009 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:16,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 24 [2019-11-16 00:32:16,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032092111] [2019-11-16 00:32:16,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-16 00:32:16,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-16 00:32:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:32:16,014 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand 24 states. [2019-11-16 00:32:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:16,945 INFO L93 Difference]: Finished difference Result 248 states and 428 transitions. [2019-11-16 00:32:16,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-16 00:32:16,945 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 188 [2019-11-16 00:32:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:16,948 INFO L225 Difference]: With dead ends: 248 [2019-11-16 00:32:16,948 INFO L226 Difference]: Without dead ends: 154 [2019-11-16 00:32:16,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=1520, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:32:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-16 00:32:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2019-11-16 00:32:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-16 00:32:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2019-11-16 00:32:16,990 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 188 [2019-11-16 00:32:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:16,992 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2019-11-16 00:32:16,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-16 00:32:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2019-11-16 00:32:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-16 00:32:17,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:17,000 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 16, 14, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:17,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:17,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -276871556, now seen corresponding path program 2 times [2019-11-16 00:32:17,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:17,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297560657] [2019-11-16 00:32:17,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:17,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:17,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 188 proven. 440 refuted. 0 times theorem prover too weak. 1351 trivial. 0 not checked. [2019-11-16 00:32:17,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297560657] [2019-11-16 00:32:17,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724347874] [2019-11-16 00:32:17,854 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:17,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:32:17,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:17,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:32:17,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 90 proven. 516 refuted. 0 times theorem prover too weak. 1373 trivial. 0 not checked. [2019-11-16 00:32:18,190 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:18,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2019-11-16 00:32:18,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367923002] [2019-11-16 00:32:18,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-16 00:32:18,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:18,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-16 00:32:18,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:32:18,192 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand 24 states. [2019-11-16 00:32:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:19,133 INFO L93 Difference]: Finished difference Result 319 states and 599 transitions. [2019-11-16 00:32:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-16 00:32:19,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 267 [2019-11-16 00:32:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:19,136 INFO L225 Difference]: With dead ends: 319 [2019-11-16 00:32:19,137 INFO L226 Difference]: Without dead ends: 193 [2019-11-16 00:32:19,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=1997, Unknown=0, NotChecked=0, Total=2352 [2019-11-16 00:32:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-16 00:32:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 154. [2019-11-16 00:32:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-16 00:32:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 242 transitions. [2019-11-16 00:32:19,170 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 242 transitions. Word has length 267 [2019-11-16 00:32:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:19,172 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 242 transitions. [2019-11-16 00:32:19,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-16 00:32:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 242 transitions. [2019-11-16 00:32:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-11-16 00:32:19,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:19,184 INFO L380 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 29, 27, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 12, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:19,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:19,388 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1784823283, now seen corresponding path program 3 times [2019-11-16 00:32:19,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:19,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936868553] [2019-11-16 00:32:19,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:19,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:19,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6469 backedges. 756 proven. 1734 refuted. 0 times theorem prover too weak. 3979 trivial. 0 not checked. [2019-11-16 00:32:20,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936868553] [2019-11-16 00:32:20,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210039839] [2019-11-16 00:32:20,947 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:21,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-11-16 00:32:21,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:21,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:32:21,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6469 backedges. 3747 proven. 86 refuted. 0 times theorem prover too weak. 2636 trivial. 0 not checked. [2019-11-16 00:32:21,410 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:21,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 30 [2019-11-16 00:32:21,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36456878] [2019-11-16 00:32:21,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:32:21,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:32:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:32:21,413 INFO L87 Difference]: Start difference. First operand 154 states and 242 transitions. Second operand 30 states. [2019-11-16 00:32:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:22,237 INFO L93 Difference]: Finished difference Result 337 states and 600 transitions. [2019-11-16 00:32:22,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-16 00:32:22,237 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 473 [2019-11-16 00:32:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:22,240 INFO L225 Difference]: With dead ends: 337 [2019-11-16 00:32:22,240 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:32:22,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:32:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:32:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 178. [2019-11-16 00:32:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-16 00:32:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 268 transitions. [2019-11-16 00:32:22,265 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 268 transitions. Word has length 473 [2019-11-16 00:32:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:22,267 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 268 transitions. [2019-11-16 00:32:22,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:32:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 268 transitions. [2019-11-16 00:32:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-16 00:32:22,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:22,276 INFO L380 BasicCegarLoop]: trace histogram [35, 35, 32, 32, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 8, 5, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:22,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:22,480 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:22,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1915545058, now seen corresponding path program 4 times [2019-11-16 00:32:22,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:22,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854813144] [2019-11-16 00:32:22,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:22,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:22,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 1104 proven. 1326 refuted. 0 times theorem prover too weak. 3660 trivial. 0 not checked. [2019-11-16 00:32:24,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854813144] [2019-11-16 00:32:24,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612349694] [2019-11-16 00:32:24,128 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:24,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:32:24,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:24,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:32:24,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 610 proven. 598 refuted. 0 times theorem prover too weak. 4882 trivial. 0 not checked. [2019-11-16 00:32:24,563 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:24,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 34 [2019-11-16 00:32:24,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124727598] [2019-11-16 00:32:24,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-16 00:32:24,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:24,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:32:24,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:32:24,569 INFO L87 Difference]: Start difference. First operand 178 states and 268 transitions. Second operand 34 states. [2019-11-16 00:32:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:26,174 INFO L93 Difference]: Finished difference Result 493 states and 885 transitions. [2019-11-16 00:32:26,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-16 00:32:26,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 459 [2019-11-16 00:32:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:26,179 INFO L225 Difference]: With dead ends: 493 [2019-11-16 00:32:26,179 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:32:26,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 596 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=368, Invalid=2388, Unknown=0, NotChecked=0, Total=2756 [2019-11-16 00:32:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:32:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 200. [2019-11-16 00:32:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-16 00:32:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 298 transitions. [2019-11-16 00:32:26,208 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 298 transitions. Word has length 459 [2019-11-16 00:32:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:26,209 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 298 transitions. [2019-11-16 00:32:26,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-16 00:32:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 298 transitions. [2019-11-16 00:32:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-11-16 00:32:26,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:26,221 INFO L380 BasicCegarLoop]: trace histogram [41, 41, 36, 36, 32, 31, 20, 20, 20, 20, 20, 20, 20, 18, 18, 18, 18, 18, 18, 18, 13, 12, 10, 4, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:26,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:26,434 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:26,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:26,434 INFO L82 PathProgramCache]: Analyzing trace with hash 150308942, now seen corresponding path program 5 times [2019-11-16 00:32:26,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:26,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144815330] [2019-11-16 00:32:26,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:26,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:26,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8133 backedges. 1861 proven. 1978 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2019-11-16 00:32:28,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144815330] [2019-11-16 00:32:28,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744447700] [2019-11-16 00:32:28,633 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:28,779 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-11-16 00:32:28,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:28,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:32:28,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8133 backedges. 4630 proven. 92 refuted. 0 times theorem prover too weak. 3411 trivial. 0 not checked. [2019-11-16 00:32:29,074 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:29,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 13] total 47 [2019-11-16 00:32:29,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451720264] [2019-11-16 00:32:29,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-16 00:32:29,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-16 00:32:29,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2019-11-16 00:32:29,079 INFO L87 Difference]: Start difference. First operand 200 states and 298 transitions. Second operand 47 states. [2019-11-16 00:32:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:30,724 INFO L93 Difference]: Finished difference Result 405 states and 640 transitions. [2019-11-16 00:32:30,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-16 00:32:30,724 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 528 [2019-11-16 00:32:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:30,727 INFO L225 Difference]: With dead ends: 405 [2019-11-16 00:32:30,727 INFO L226 Difference]: Without dead ends: 163 [2019-11-16 00:32:30,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=601, Invalid=4369, Unknown=0, NotChecked=0, Total=4970 [2019-11-16 00:32:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-16 00:32:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2019-11-16 00:32:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-16 00:32:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 184 transitions. [2019-11-16 00:32:30,743 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 184 transitions. Word has length 528 [2019-11-16 00:32:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:30,745 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 184 transitions. [2019-11-16 00:32:30,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-16 00:32:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2019-11-16 00:32:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-11-16 00:32:30,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:30,753 INFO L380 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 23, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:30,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:30,957 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:30,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1883855983, now seen corresponding path program 6 times [2019-11-16 00:32:30,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:30,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634986803] [2019-11-16 00:32:30,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:30,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:30,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 696 proven. 800 refuted. 0 times theorem prover too weak. 2874 trivial. 0 not checked. [2019-11-16 00:32:32,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634986803] [2019-11-16 00:32:32,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604187379] [2019-11-16 00:32:32,224 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:32,353 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-16 00:32:32,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:32,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:32:32,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 603 proven. 95 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2019-11-16 00:32:32,573 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:32,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 10] total 34 [2019-11-16 00:32:32,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682655343] [2019-11-16 00:32:32,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-16 00:32:32,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:32:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:32:32,577 INFO L87 Difference]: Start difference. First operand 148 states and 184 transitions. Second operand 34 states. [2019-11-16 00:32:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:33,609 INFO L93 Difference]: Finished difference Result 259 states and 329 transitions. [2019-11-16 00:32:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-16 00:32:33,610 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 391 [2019-11-16 00:32:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:33,612 INFO L225 Difference]: With dead ends: 259 [2019-11-16 00:32:33,613 INFO L226 Difference]: Without dead ends: 193 [2019-11-16 00:32:33,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=384, Invalid=2586, Unknown=0, NotChecked=0, Total=2970 [2019-11-16 00:32:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-16 00:32:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2019-11-16 00:32:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-16 00:32:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2019-11-16 00:32:33,625 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 391 [2019-11-16 00:32:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:33,626 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2019-11-16 00:32:33,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-16 00:32:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2019-11-16 00:32:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-11-16 00:32:33,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:33,631 INFO L380 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 34, 33, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 14, 12, 8, 8, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:33,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:33,843 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 932975275, now seen corresponding path program 7 times [2019-11-16 00:32:33,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:33,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023562144] [2019-11-16 00:32:33,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:33,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:33,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 918 proven. 1776 refuted. 0 times theorem prover too weak. 6719 trivial. 0 not checked. [2019-11-16 00:32:35,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023562144] [2019-11-16 00:32:35,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352253207] [2019-11-16 00:32:35,706 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:32:35,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 961 proven. 570 refuted. 0 times theorem prover too weak. 7882 trivial. 0 not checked. [2019-11-16 00:32:36,328 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:36,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13] total 36 [2019-11-16 00:32:36,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847368406] [2019-11-16 00:32:36,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-16 00:32:36,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:36,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-16 00:32:36,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:32:36,331 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand 36 states. [2019-11-16 00:32:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:37,243 INFO L93 Difference]: Finished difference Result 237 states and 284 transitions. [2019-11-16 00:32:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-16 00:32:37,244 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 568 [2019-11-16 00:32:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:37,247 INFO L225 Difference]: With dead ends: 237 [2019-11-16 00:32:37,247 INFO L226 Difference]: Without dead ends: 187 [2019-11-16 00:32:37,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 728 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=427, Invalid=2765, Unknown=0, NotChecked=0, Total=3192 [2019-11-16 00:32:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-16 00:32:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-11-16 00:32:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-16 00:32:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2019-11-16 00:32:37,262 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 568 [2019-11-16 00:32:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:37,263 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2019-11-16 00:32:37,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-16 00:32:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2019-11-16 00:32:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-11-16 00:32:37,267 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:37,267 INFO L380 BasicCegarLoop]: trace histogram [38, 38, 35, 35, 30, 29, 19, 19, 19, 19, 19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 13, 10, 8, 6, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:37,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:37,471 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash 730094298, now seen corresponding path program 8 times [2019-11-16 00:32:37,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:37,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270173383] [2019-11-16 00:32:37,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 1350 proven. 1399 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-11-16 00:32:39,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270173383] [2019-11-16 00:32:39,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545509347] [2019-11-16 00:32:39,093 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:39,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:32:39,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:39,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:32:39,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 948 proven. 208 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2019-11-16 00:32:39,514 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:39,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 12] total 43 [2019-11-16 00:32:39,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086008034] [2019-11-16 00:32:39,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-16 00:32:39,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-16 00:32:39,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1582, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:32:39,518 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand 43 states. [2019-11-16 00:32:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:40,584 INFO L93 Difference]: Finished difference Result 260 states and 296 transitions. [2019-11-16 00:32:40,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-16 00:32:40,585 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 500 [2019-11-16 00:32:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:40,588 INFO L225 Difference]: With dead ends: 260 [2019-11-16 00:32:40,588 INFO L226 Difference]: Without dead ends: 191 [2019-11-16 00:32:40,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1692 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=624, Invalid=3932, Unknown=0, NotChecked=0, Total=4556 [2019-11-16 00:32:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-16 00:32:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 153. [2019-11-16 00:32:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:32:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2019-11-16 00:32:40,607 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 500 [2019-11-16 00:32:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:40,610 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2019-11-16 00:32:40,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-16 00:32:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2019-11-16 00:32:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-16 00:32:40,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:40,613 INFO L380 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] [2019-11-16 00:32:40,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:40,818 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:40,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 706303904, now seen corresponding path program 9 times [2019-11-16 00:32:40,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:40,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816963756] [2019-11-16 00:32:40,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:40,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:40,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6082 backedges. 0 proven. 2033 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2019-11-16 00:32:43,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816963756] [2019-11-16 00:32:43,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144275962] [2019-11-16 00:32:43,697 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:43,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-11-16 00:32:43,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:43,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 271 conjunts are in the unsatisfiable core [2019-11-16 00:32:43,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6082 backedges. 0 proven. 2033 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2019-11-16 00:32:45,933 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:45,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 52 [2019-11-16 00:32:45,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409543215] [2019-11-16 00:32:45,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-16 00:32:45,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-16 00:32:45,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2527, Unknown=0, NotChecked=0, Total=2652 [2019-11-16 00:32:45,937 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand 52 states. [2019-11-16 00:32:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:46,664 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2019-11-16 00:32:46,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-16 00:32:46,664 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 459 [2019-11-16 00:32:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:46,665 INFO L225 Difference]: With dead ends: 153 [2019-11-16 00:32:46,665 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:32:46,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 644 SyntacticMatches, 35 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=125, Invalid=2527, Unknown=0, NotChecked=0, Total=2652 [2019-11-16 00:32:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:32:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:32:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:32:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:32:46,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 459 [2019-11-16 00:32:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:46,668 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:32:46,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-16 00:32:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:32:46,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:32:46,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:46,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:32:47,908 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 7 [2019-11-16 00:32:48,121 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 1 [2019-11-16 00:32:48,621 WARN L191 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 43 [2019-11-16 00:32:48,784 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 6 [2019-11-16 00:32:49,461 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 40 [2019-11-16 00:32:49,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:32:49,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:32:49,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:32:49,463 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-16 00:32:49,463 INFO L439 ceAbstractionStarter]: At program point L41(lines 35 42) the Hoare annotation is: (<= 8 ULTIMATE.start_main_~x~0) [2019-11-16 00:32:49,464 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-16 00:32:49,464 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-16 00:32:49,464 INFO L439 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0)) [2019-11-16 00:32:49,464 INFO L443 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-16 00:32:49,464 INFO L443 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-11-16 00:32:49,464 INFO L446 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-11-16 00:32:49,464 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 2))) [2019-11-16 00:32:49,464 INFO L443 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-16 00:32:49,464 INFO L439 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 7 fibo2_~n) .cse0) (not (<= 5 |fibo2_#in~n|)) (and (<= 5 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 5))) (or (and (<= |fibo2_#t~ret2| 2) (<= 2 |fibo2_#t~ret2|)) (not (<= |fibo2_#in~n| 5)) (and (<= fibo2_~n 3) .cse0)) (or (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1) (<= 3 fibo2_~n)) (not (<= |fibo2_#in~n| 3))) (or (and (<= |fibo2_#in~n| 6) .cse0) (and (<= 8 |fibo2_#in~n|) .cse0) (and (<= 8 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 8))))) [2019-11-16 00:32:49,464 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-11-16 00:32:49,464 INFO L443 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-11-16 00:32:49,464 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-11-16 00:32:49,465 INFO L443 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-11-16 00:32:49,465 INFO L443 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-11-16 00:32:49,465 INFO L446 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-11-16 00:32:49,465 INFO L439 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2019-11-16 00:32:49,465 INFO L443 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-11-16 00:32:49,465 INFO L439 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (and (or (<= |fibo1_#in~n| 7) (and (<= 13 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 13)) (<= 9 |fibo1_#in~n|)) (or (and (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|)) (<= 7 fibo1_~n) (<= fibo1_~n 5)) (< 1 fibo1_~n) (or (not (<= |fibo1_#in~n| 4)) (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))) (= fibo1_~n |fibo1_#in~n|) (or (not (<= 4 |fibo1_#in~n|)) (<= 6 fibo1_~n) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3)))) [2019-11-16 00:32:49,465 INFO L443 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-11-16 00:32:49,465 INFO L443 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-11-16 00:32:49,465 INFO L443 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-16 00:32:49,465 INFO L443 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-11-16 00:32:49,465 INFO L443 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-11-16 00:32:49,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:32:49 BoogieIcfgContainer [2019-11-16 00:32:49,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:32:49,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:32:49,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:32:49,476 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:32:49,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:09" (3/4) ... [2019-11-16 00:32:49,479 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:32:49,485 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-11-16 00:32:49,485 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-11-16 00:32:49,489 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:32:49,489 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:32:49,528 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3ef92f2b-5238-42bf-8495-81229c952380/bin/uautomizer/witness.graphml [2019-11-16 00:32:49,529 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:32:49,530 INFO L168 Benchmark]: Toolchain (without parser) took 41166.14 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 944.7 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 327.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:49,530 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:49,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:49,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:49,531 INFO L168 Benchmark]: Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:49,532 INFO L168 Benchmark]: RCFGBuilder took 301.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:49,532 INFO L168 Benchmark]: TraceAbstraction took 40433.76 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-16 00:32:49,532 INFO L168 Benchmark]: Witness Printer took 53.44 ms. Allocated memory is still 2.7 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:49,534 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 301.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40433.76 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 53.44 ms. Allocated memory is still 2.7 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 8 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 40.3s, OverallIterations: 17, TraceHistogramMax: 42, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, HoareTripleCheckerStatistics: 598 SDtfs, 1653 SDslu, 7578 SDs, 0 SdLazy, 11506 SolverSat, 1806 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5944 GetRequests, 5325 SyntacticMatches, 39 SemanticMatches, 580 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8087 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 284 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 794 PreInvPairs, 1309 NumberOfFragments, 166 HoareAnnotationTreeSize, 794 FomulaSimplifications, 17285 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 8 FomulaSimplificationsInter, 27437 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 8197 NumberOfCodeBlocks, 7575 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 8165 ConstructedInterpolants, 0 QuantifiedInterpolants, 6468015 SizeOfPredicates, 85 NumberOfNonLiveVariables, 7676 ConjunctsInSsa, 442 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 85536/102018 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...