./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1-3.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_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:01,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:24:01,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:24:02,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:24:02,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:24:02,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:24:02,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:24:02,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:24:02,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:24:02,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:24:02,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:24:02,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:24:02,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:24:02,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:24:02,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:24:02,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:24:02,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:24:02,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:24:02,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:24:02,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:24:02,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:24:02,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:24:02,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:24:02,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:24:02,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:24:02,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:24:02,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:24:02,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:24:02,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:24:02,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:24:02,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:24:02,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:24:02,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:24:02,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:24:02,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:24:02,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:24:02,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:24:02,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:24:02,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:24:02,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:24:02,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:24:02,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:24:02,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:24:02,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:24:02,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:24:02,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:24:02,089 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:24:02,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:24:02,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:24:02,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:24:02,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:24:02,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:24:02,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:24:02,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:24:02,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:24:02,091 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:24:02,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:24:02,091 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:24:02,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:24:02,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:24:02,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:24:02,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:24:02,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:24:02,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:24:02,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:24:02,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:24:02,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:24:02,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:24:02,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:24:02,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:24:02,094 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_fc081e8c-e801-42e6-a804-33617529df54/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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2019-11-16 00:24:02,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:24:02,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:24:02,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:24:02,142 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:24:02,143 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:24:02,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/../../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-11-16 00:24:02,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/data/137d3c30c/6f2a03f424a34c3e9ad82a947d7fd0c8/FLAG2cec13979 [2019-11-16 00:24:02,609 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:24:02,609 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-11-16 00:24:02,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/data/137d3c30c/6f2a03f424a34c3e9ad82a947d7fd0c8/FLAG2cec13979 [2019-11-16 00:24:02,932 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/data/137d3c30c/6f2a03f424a34c3e9ad82a947d7fd0c8 [2019-11-16 00:24:02,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:24:02,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:24:02,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:24:02,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:24:02,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:24:02,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da2f091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02, skipping insertion in model container [2019-11-16 00:24:02,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,948 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:24:02,983 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:24:03,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:24:03,313 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:24:03,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:24:03,434 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:24:03,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03 WrapperNode [2019-11-16 00:24:03,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:24:03,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:24:03,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:24:03,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:24:03,443 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:24:03" (1/1) ... [2019-11-16 00:24:03,453 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:24:03" (1/1) ... [2019-11-16 00:24:03,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:24:03,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:24:03,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:24:03,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:24:03,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (1/1) ... [2019-11-16 00:24:03,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (1/1) ... [2019-11-16 00:24:03,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (1/1) ... [2019-11-16 00:24:03,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (1/1) ... [2019-11-16 00:24:03,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (1/1) ... [2019-11-16 00:24:03,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (1/1) ... [2019-11-16 00:24:03,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (1/1) ... [2019-11-16 00:24:03,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:24:03,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:24:03,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:24:03,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:24:03,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/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:24:03,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:24:03,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:24:04,627 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:24:04,627 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-16 00:24:04,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:04 BoogieIcfgContainer [2019-11-16 00:24:04,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:24:04,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:24:04,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:24:04,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:24:04,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:24:02" (1/3) ... [2019-11-16 00:24:04,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f88c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:04, skipping insertion in model container [2019-11-16 00:24:04,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:03" (2/3) ... [2019-11-16 00:24:04,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f88c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:24:04, skipping insertion in model container [2019-11-16 00:24:04,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:04" (3/3) ... [2019-11-16 00:24:04,637 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-11-16 00:24:04,658 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:24:04,665 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:24:04,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:24:04,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:24:04,718 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:24:04,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:24:04,719 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:24:04,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:24:04,720 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:24:04,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:24:04,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:24:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-11-16 00:24:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:24:04,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:04,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:04,756 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2019-11-16 00:24:04,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:04,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23815371] [2019-11-16 00:24:04,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,894 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:24:04,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23815371] [2019-11-16 00:24:04,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:04,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:24:04,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358290748] [2019-11-16 00:24:04,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:24:04,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:24:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:24:04,915 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2019-11-16 00:24:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:04,956 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2019-11-16 00:24:04,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:24:04,959 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-16 00:24:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:04,975 INFO L225 Difference]: With dead ends: 216 [2019-11-16 00:24:04,975 INFO L226 Difference]: Without dead ends: 100 [2019-11-16 00:24:04,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:24:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-16 00:24:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-16 00:24:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-16 00:24:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2019-11-16 00:24:05,035 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2019-11-16 00:24:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:05,036 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2019-11-16 00:24:05,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:24:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2019-11-16 00:24:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:24:05,038 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:05,038 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:05,039 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2019-11-16 00:24:05,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:05,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151974038] [2019-11-16 00:24:05,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,120 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:24:05,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151974038] [2019-11-16 00:24:05,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:05,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:05,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839580457] [2019-11-16 00:24:05,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:05,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:05,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:05,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:05,123 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand 3 states. [2019-11-16 00:24:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:05,174 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2019-11-16 00:24:05,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:05,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-16 00:24:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:05,176 INFO L225 Difference]: With dead ends: 201 [2019-11-16 00:24:05,177 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:24:05,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:24:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-16 00:24:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-16 00:24:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2019-11-16 00:24:05,185 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2019-11-16 00:24:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:05,186 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2019-11-16 00:24:05,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2019-11-16 00:24:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:24:05,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:05,187 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:05,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:05,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,187 INFO L82 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2019-11-16 00:24:05,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:05,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553719165] [2019-11-16 00:24:05,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,644 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2019-11-16 00:24:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:05,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553719165] [2019-11-16 00:24:05,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:05,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:24:05,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919597033] [2019-11-16 00:24:05,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:24:05,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:05,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:05,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:05,661 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 4 states. [2019-11-16 00:24:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:06,197 INFO L93 Difference]: Finished difference Result 205 states and 334 transitions. [2019-11-16 00:24:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:06,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-16 00:24:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:06,200 INFO L225 Difference]: With dead ends: 205 [2019-11-16 00:24:06,200 INFO L226 Difference]: Without dead ends: 186 [2019-11-16 00:24:06,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-16 00:24:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2019-11-16 00:24:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-16 00:24:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2019-11-16 00:24:06,214 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2019-11-16 00:24:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:06,214 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2019-11-16 00:24:06,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:24:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2019-11-16 00:24:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:24:06,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:06,216 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:06,216 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:06,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2019-11-16 00:24:06,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:06,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632055829] [2019-11-16 00:24:06,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:06,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632055829] [2019-11-16 00:24:06,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:06,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:06,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528296155] [2019-11-16 00:24:06,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:06,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:06,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:06,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:06,263 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand 3 states. [2019-11-16 00:24:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:06,295 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2019-11-16 00:24:06,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:06,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-16 00:24:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:06,297 INFO L225 Difference]: With dead ends: 293 [2019-11-16 00:24:06,297 INFO L226 Difference]: Without dead ends: 124 [2019-11-16 00:24:06,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-16 00:24:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-16 00:24:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-16 00:24:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2019-11-16 00:24:06,306 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2019-11-16 00:24:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:06,307 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2019-11-16 00:24:06,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2019-11-16 00:24:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:24:06,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:06,308 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:06,309 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2019-11-16 00:24:06,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:06,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398964014] [2019-11-16 00:24:06,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:24:06,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398964014] [2019-11-16 00:24:06,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:06,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:06,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960194841] [2019-11-16 00:24:06,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:06,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:06,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:06,355 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand 3 states. [2019-11-16 00:24:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:06,384 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2019-11-16 00:24:06,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:06,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-16 00:24:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:06,386 INFO L225 Difference]: With dead ends: 226 [2019-11-16 00:24:06,386 INFO L226 Difference]: Without dead ends: 107 [2019-11-16 00:24:06,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-16 00:24:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-16 00:24:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:24:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2019-11-16 00:24:06,393 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 21 [2019-11-16 00:24:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:06,393 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2019-11-16 00:24:06,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2019-11-16 00:24:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:24:06,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:06,395 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:06,395 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2019-11-16 00:24:06,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:06,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549121984] [2019-11-16 00:24:06,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,688 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-11-16 00:24:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:08,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549121984] [2019-11-16 00:24:08,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939582492] [2019-11-16 00:24:08,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/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:24:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:08,839 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:08,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-16 00:24:08,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541410541] [2019-11-16 00:24:08,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:24:08,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:08,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:24:08,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:24:08,841 INFO L87 Difference]: Start difference. First operand 105 states and 163 transitions. Second operand 7 states. [2019-11-16 00:24:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:09,547 INFO L93 Difference]: Finished difference Result 359 states and 564 transitions. [2019-11-16 00:24:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:24:09,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-16 00:24:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:09,550 INFO L225 Difference]: With dead ends: 359 [2019-11-16 00:24:09,550 INFO L226 Difference]: Without dead ends: 319 [2019-11-16 00:24:09,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:24:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-16 00:24:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2019-11-16 00:24:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-16 00:24:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 434 transitions. [2019-11-16 00:24:09,564 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 434 transitions. Word has length 23 [2019-11-16 00:24:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:09,565 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 434 transitions. [2019-11-16 00:24:09,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:24:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 434 transitions. [2019-11-16 00:24:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:24:09,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:09,567 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:09,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:09,779 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1800121285, now seen corresponding path program 1 times [2019-11-16 00:24:09,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:09,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659490985] [2019-11-16 00:24:09,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:24:09,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659490985] [2019-11-16 00:24:09,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:09,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:09,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172471845] [2019-11-16 00:24:09,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:09,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:09,842 INFO L87 Difference]: Start difference. First operand 275 states and 434 transitions. Second operand 3 states. [2019-11-16 00:24:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:09,876 INFO L93 Difference]: Finished difference Result 548 states and 861 transitions. [2019-11-16 00:24:09,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:09,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-16 00:24:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:09,880 INFO L225 Difference]: With dead ends: 548 [2019-11-16 00:24:09,882 INFO L226 Difference]: Without dead ends: 297 [2019-11-16 00:24:09,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-16 00:24:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-11-16 00:24:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-16 00:24:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2019-11-16 00:24:09,895 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 25 [2019-11-16 00:24:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:09,896 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2019-11-16 00:24:09,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:09,896 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2019-11-16 00:24:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:24:09,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:09,900 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 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:24:09,901 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:09,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:09,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2019-11-16 00:24:09,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:09,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275068055] [2019-11-16 00:24:09,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:10,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275068055] [2019-11-16 00:24:10,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079849775] [2019-11-16 00:24:10,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/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:24:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:10,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:24:10,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:24:10,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:24:10,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-16 00:24:10,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699496370] [2019-11-16 00:24:10,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:10,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:10,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:10,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:10,270 INFO L87 Difference]: Start difference. First operand 295 states and 454 transitions. Second operand 3 states. [2019-11-16 00:24:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:10,287 INFO L93 Difference]: Finished difference Result 298 states and 456 transitions. [2019-11-16 00:24:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:10,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-16 00:24:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:10,290 INFO L225 Difference]: With dead ends: 298 [2019-11-16 00:24:10,290 INFO L226 Difference]: Without dead ends: 292 [2019-11-16 00:24:10,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:24:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-16 00:24:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-11-16 00:24:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-16 00:24:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 442 transitions. [2019-11-16 00:24:10,300 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 442 transitions. Word has length 27 [2019-11-16 00:24:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:10,301 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 442 transitions. [2019-11-16 00:24:10,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 442 transitions. [2019-11-16 00:24:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:24:10,302 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:10,302 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:10,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:10,514 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -917092134, now seen corresponding path program 1 times [2019-11-16 00:24:10,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:10,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062001419] [2019-11-16 00:24:10,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:10,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:10,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:24:10,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062001419] [2019-11-16 00:24:10,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:10,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:10,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356076766] [2019-11-16 00:24:10,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:10,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:10,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:10,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:10,585 INFO L87 Difference]: Start difference. First operand 291 states and 442 transitions. Second operand 3 states. [2019-11-16 00:24:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:10,620 INFO L93 Difference]: Finished difference Result 510 states and 775 transitions. [2019-11-16 00:24:10,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:10,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-16 00:24:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:10,623 INFO L225 Difference]: With dead ends: 510 [2019-11-16 00:24:10,623 INFO L226 Difference]: Without dead ends: 243 [2019-11-16 00:24:10,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-16 00:24:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-11-16 00:24:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-16 00:24:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2019-11-16 00:24:10,633 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 33 [2019-11-16 00:24:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:10,633 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2019-11-16 00:24:10,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2019-11-16 00:24:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:24:10,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:10,634 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:10,635 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2019-11-16 00:24:10,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:10,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313384250] [2019-11-16 00:24:10,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:10,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:10,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:24:10,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313384250] [2019-11-16 00:24:10,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:10,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:10,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062183051] [2019-11-16 00:24:10,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:10,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:10,694 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand 3 states. [2019-11-16 00:24:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:10,732 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2019-11-16 00:24:10,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:10,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-16 00:24:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:10,735 INFO L225 Difference]: With dead ends: 424 [2019-11-16 00:24:10,735 INFO L226 Difference]: Without dead ends: 225 [2019-11-16 00:24:10,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-16 00:24:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-11-16 00:24:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-16 00:24:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2019-11-16 00:24:10,744 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2019-11-16 00:24:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:10,745 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2019-11-16 00:24:10,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2019-11-16 00:24:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:24:10,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:10,748 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:10,749 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2019-11-16 00:24:10,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:10,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205986592] [2019-11-16 00:24:10,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:10,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:10,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:24:10,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205986592] [2019-11-16 00:24:10,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:10,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:10,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033390352] [2019-11-16 00:24:10,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:24:10,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:24:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:10,815 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand 3 states. [2019-11-16 00:24:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:10,849 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-11-16 00:24:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:24:10,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-16 00:24:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:10,851 INFO L225 Difference]: With dead ends: 305 [2019-11-16 00:24:10,851 INFO L226 Difference]: Without dead ends: 143 [2019-11-16 00:24:10,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:24:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-16 00:24:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-11-16 00:24:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-16 00:24:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2019-11-16 00:24:10,859 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2019-11-16 00:24:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:10,859 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2019-11-16 00:24:10,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:24:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2019-11-16 00:24:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:24:10,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:10,860 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:10,861 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2019-11-16 00:24:10,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:10,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650304042] [2019-11-16 00:24:10,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:10,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:10,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:24:11,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650304042] [2019-11-16 00:24:11,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492663678] [2019-11-16 00:24:11,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/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:24:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:11,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:24:11,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:11,271 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:11,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-16 00:24:11,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429750094] [2019-11-16 00:24:11,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:24:11,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:24:11,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:24:11,273 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand 10 states. [2019-11-16 00:24:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:11,407 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2019-11-16 00:24:11,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:24:11,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-16 00:24:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:11,409 INFO L225 Difference]: With dead ends: 167 [2019-11-16 00:24:11,409 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:24:11,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:24:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:24:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-11-16 00:24:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-16 00:24:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2019-11-16 00:24:11,416 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 47 [2019-11-16 00:24:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:11,417 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2019-11-16 00:24:11,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:24:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2019-11-16 00:24:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:24:11,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:11,418 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:11,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:11,637 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:11,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:11,638 INFO L82 PathProgramCache]: Analyzing trace with hash 751253453, now seen corresponding path program 1 times [2019-11-16 00:24:11,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:11,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002847177] [2019-11-16 00:24:11,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:11,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:11,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:12,108 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 31 [2019-11-16 00:24:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:12,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002847177] [2019-11-16 00:24:12,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629641503] [2019-11-16 00:24:12,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/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:24:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:12,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:24:12,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:12,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:24:12,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:12,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:12,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:12,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:12,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:12,385 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:12,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-16 00:24:12,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101523248] [2019-11-16 00:24:12,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:24:12,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:24:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:24:12,387 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand 10 states. [2019-11-16 00:24:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:12,725 INFO L93 Difference]: Finished difference Result 177 states and 246 transitions. [2019-11-16 00:24:12,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:24:12,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-16 00:24:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:12,726 INFO L225 Difference]: With dead ends: 177 [2019-11-16 00:24:12,727 INFO L226 Difference]: Without dead ends: 175 [2019-11-16 00:24:12,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:24:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-16 00:24:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-11-16 00:24:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-16 00:24:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 243 transitions. [2019-11-16 00:24:12,735 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 243 transitions. Word has length 57 [2019-11-16 00:24:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:12,736 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 243 transitions. [2019-11-16 00:24:12,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:24:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 243 transitions. [2019-11-16 00:24:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:24:12,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:12,737 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:12,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:12,940 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 384172331, now seen corresponding path program 1 times [2019-11-16 00:24:12,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:12,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384763927] [2019-11-16 00:24:12,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:12,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:12,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:13,337 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-16 00:24:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:13,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384763927] [2019-11-16 00:24:13,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558792846] [2019-11-16 00:24:13,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/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:24:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:13,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:24:13,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:13,523 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:13,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-11-16 00:24:13,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950916443] [2019-11-16 00:24:13,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:24:13,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:13,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:24:13,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:24:13,525 INFO L87 Difference]: Start difference. First operand 174 states and 243 transitions. Second operand 9 states. [2019-11-16 00:24:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:13,651 INFO L93 Difference]: Finished difference Result 194 states and 270 transitions. [2019-11-16 00:24:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:24:13,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-16 00:24:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:13,653 INFO L225 Difference]: With dead ends: 194 [2019-11-16 00:24:13,653 INFO L226 Difference]: Without dead ends: 192 [2019-11-16 00:24:13,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:24:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-16 00:24:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-16 00:24:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-16 00:24:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 268 transitions. [2019-11-16 00:24:13,660 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 268 transitions. Word has length 66 [2019-11-16 00:24:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:13,661 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 268 transitions. [2019-11-16 00:24:13,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:24:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 268 transitions. [2019-11-16 00:24:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:24:13,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:13,662 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:13,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:13,866 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:24:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2057891779, now seen corresponding path program 1 times [2019-11-16 00:24:13,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:13,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560461320] [2019-11-16 00:24:13,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:13,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:13,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:16,366 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 74 DAG size of output: 21 [2019-11-16 00:24:24,737 WARN L191 SmtUtils]: Spent 8.21 s on a formula simplification. DAG size of input: 169 DAG size of output: 31 [2019-11-16 00:24:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:24:24,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560461320] [2019-11-16 00:24:24,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790643783] [2019-11-16 00:24:24,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/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:24:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:24,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:24:24,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:24,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:25,114 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:25,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-11-16 00:24:25,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788396160] [2019-11-16 00:24:25,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:24:25,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:25,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:24:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:24:25,116 INFO L87 Difference]: Start difference. First operand 192 states and 268 transitions. Second operand 16 states. [2019-11-16 00:24:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:25,312 INFO L93 Difference]: Finished difference Result 211 states and 295 transitions. [2019-11-16 00:24:25,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:24:25,313 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-11-16 00:24:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:25,313 INFO L225 Difference]: With dead ends: 211 [2019-11-16 00:24:25,314 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:24:25,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:24:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:24:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:24:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:24:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:24:25,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-16 00:24:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:25,315 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:24:25,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:24:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:24:25,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:24:25,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:25,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:24:25,731 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-11-16 00:24:25,807 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-11-16 00:24:25,808 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-11-16 00:24:25,809 INFO L446 ceAbstractionStarter]: At program point L14(lines 14 566) the Hoare annotation is: true [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-16 00:24:25,810 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L439 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2)) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)))) [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-11-16 00:24:25,811 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-11-16 00:24:25,812 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:24:25,813 INFO L439 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 1)) 2)) 1))) (.cse5 (= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse4 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2))) (.cse2 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse3 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and (= ULTIMATE.start_main_~q~0 3) .cse1 .cse0 .cse2 .cse3) (and (= 1 ULTIMATE.start_main_~q~0) .cse4 .cse5 .cse2 .cse3) (and .cse1 (= ULTIMATE.start_main_~q~0 4) .cse5 .cse2 .cse3) (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse4 .cse2 .cse3))) [2019-11-16 00:24:25,813 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-11-16 00:24:25,813 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-11-16 00:24:25,813 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-11-16 00:24:25,815 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-11-16 00:24:25,815 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-11-16 00:24:25,816 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-11-16 00:24:25,816 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-11-16 00:24:25,817 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-11-16 00:24:25,817 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-11-16 00:24:25,817 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-11-16 00:24:25,818 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-11-16 00:24:25,818 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-11-16 00:24:25,818 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-11-16 00:24:25,818 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-11-16 00:24:25,818 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-11-16 00:24:25,818 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-11-16 00:24:25,818 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-11-16 00:24:25,819 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-11-16 00:24:25,819 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-11-16 00:24:25,819 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-11-16 00:24:25,819 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-11-16 00:24:25,819 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-11-16 00:24:25,819 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:24:25,819 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-16 00:24:25,819 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-11-16 00:24:25,820 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-11-16 00:24:25,820 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-16 00:24:25,820 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-11-16 00:24:25,820 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-11-16 00:24:25,820 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-11-16 00:24:25,820 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-11-16 00:24:25,820 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-16 00:24:25,820 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-16 00:24:25,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:24:25 BoogieIcfgContainer [2019-11-16 00:24:25,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:24:25,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:24:25,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:24:25,855 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:24:25,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:04" (3/4) ... [2019-11-16 00:24:25,859 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:24:25,881 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:24:25,881 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:24:25,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fc081e8c-e801-42e6-a804-33617529df54/bin/uautomizer/witness.graphml [2019-11-16 00:24:25,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:24:25,944 INFO L168 Benchmark]: Toolchain (without parser) took 23007.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 944.7 MB in the beginning and 957.6 MB in the end (delta: -12.9 MB). Peak memory consumption was 177.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:25,945 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:24:25,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:25,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:25,954 INFO L168 Benchmark]: Boogie Preprocessor took 46.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:24:25,954 INFO L168 Benchmark]: RCFGBuilder took 1078.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:25,955 INFO L168 Benchmark]: TraceAbstraction took 21224.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 97.1 MB). Peak memory consumption was 148.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:25,955 INFO L168 Benchmark]: Witness Printer took 88.07 ms. Allocated memory is still 1.2 GB. Free memory was 959.6 MB in the beginning and 957.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:25,958 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 496.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1078.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21224.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 97.1 MB). Peak memory consumption was 148.0 MB. Max. memory is 11.5 GB. * Witness Printer took 88.07 ms. Allocated memory is still 1.2 GB. Free memory was 959.6 MB in the beginning and 957.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0) || ((((q == 3 && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && this_buffer_empty == 0) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((1 == q && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((this_expect <= 2 * ((this_expect + -1) / 2) + 1 && q == 4) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0) || ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Result: SAFE, OverallTime: 21.1s, OverallIterations: 15, TraceHistogramMax: 8, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 2279 SDtfs, 1913 SDslu, 5120 SDs, 0 SdLazy, 831 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 306 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 74 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 20 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 975 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 257 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 501405 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 215/668 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...