./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:41:17,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:41:17,012 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:41:17,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:41:17,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:41:17,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:41:17,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:41:17,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:41:17,021 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:41:17,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:41:17,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:41:17,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:41:17,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:41:17,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:41:17,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:41:17,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:41:17,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:41:17,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:41:17,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:41:17,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:41:17,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:41:17,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:41:17,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:41:17,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:41:17,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:41:17,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:41:17,030 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:41:17,031 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:41:17,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:41:17,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:41:17,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:41:17,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:41:17,032 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:41:17,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:41:17,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:41:17,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:41:17,033 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 17:41:17,040 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:41:17,041 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:41:17,041 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:41:17,041 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:41:17,042 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:41:17,042 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:41:17,042 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 17:41:17,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:41:17,042 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:41:17,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:41:17,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:41:17,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:41:17,042 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:41:17,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:41:17,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:41:17,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:41:17,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:41:17,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:41:17,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:41:17,044 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 17:41:17,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:41:17,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:41:17,044 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-12-08 17:41:17,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:41:17,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:41:17,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:41:17,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:41:17,072 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:41:17,073 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-08 17:41:17,110 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data/7f070817d/0e70769db1e3408992e226a4aabc8a92/FLAG64b22ac57 [2018-12-08 17:41:17,505 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:41:17,505 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-08 17:41:17,510 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data/7f070817d/0e70769db1e3408992e226a4aabc8a92/FLAG64b22ac57 [2018-12-08 17:41:17,519 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data/7f070817d/0e70769db1e3408992e226a4aabc8a92 [2018-12-08 17:41:17,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:41:17,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:41:17,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:41:17,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:41:17,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:41:17,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42aa496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17, skipping insertion in model container [2018-12-08 17:41:17,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:41:17,550 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:41:17,661 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:41:17,663 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:41:17,683 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:41:17,691 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:41:17,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17 WrapperNode [2018-12-08 17:41:17,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:41:17,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:41:17,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:41:17,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:41:17,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:41:17,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:41:17,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:41:17,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:41:17,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... [2018-12-08 17:41:17,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:41:17,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:41:17,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:41:17,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:41:17,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:41:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-08 17:41:17,793 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-08 17:41:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:41:17,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:41:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:41:17,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:41:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:41:17,793 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:41:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 17:41:17,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 17:41:17,950 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:41:17,950 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 17:41:17,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:41:17 BoogieIcfgContainer [2018-12-08 17:41:17,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:41:17,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:41:17,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:41:17,952 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:41:17,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:41:17" (1/3) ... [2018-12-08 17:41:17,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb8e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:41:17, skipping insertion in model container [2018-12-08 17:41:17,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:17" (2/3) ... [2018-12-08 17:41:17,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb8e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:41:17, skipping insertion in model container [2018-12-08 17:41:17,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:41:17" (3/3) ... [2018-12-08 17:41:17,954 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-08 17:41:17,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:41:17,964 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 17:41:17,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 17:41:17,991 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:41:17,991 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:41:17,991 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:41:17,991 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:41:17,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:41:17,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:41:17,992 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:41:17,992 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:41:17,992 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:41:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-08 17:41:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:41:18,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:18,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:18,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:18,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2018-12-08 17:41:18,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:18,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:18,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:18,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:41:18,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 17:41:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 17:41:18,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:41:18,098 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-08 17:41:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:18,111 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2018-12-08 17:41:18,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 17:41:18,112 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-08 17:41:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:18,117 INFO L225 Difference]: With dead ends: 76 [2018-12-08 17:41:18,117 INFO L226 Difference]: Without dead ends: 47 [2018-12-08 17:41:18,119 INFO L631 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 [2018-12-08 17:41:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-08 17:41:18,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-08 17:41:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 17:41:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-12-08 17:41:18,141 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-12-08 17:41:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:18,141 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-12-08 17:41:18,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 17:41:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-12-08 17:41:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:41:18,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:18,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:18,142 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:18,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2018-12-08 17:41:18,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:18,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:18,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:18,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:18,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:18,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:41:18,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:41:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:41:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:41:18,209 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2018-12-08 17:41:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:18,304 INFO L93 Difference]: Finished difference Result 102 states and 169 transitions. [2018-12-08 17:41:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:41:18,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 17:41:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:18,305 INFO L225 Difference]: With dead ends: 102 [2018-12-08 17:41:18,305 INFO L226 Difference]: Without dead ends: 70 [2018-12-08 17:41:18,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:41:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-08 17:41:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-08 17:41:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 17:41:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2018-12-08 17:41:18,311 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 21 [2018-12-08 17:41:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:18,311 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2018-12-08 17:41:18,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:41:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2018-12-08 17:41:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 17:41:18,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:18,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:18,312 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:18,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1473767205, now seen corresponding path program 1 times [2018-12-08 17:41:18,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:18,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:18,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:41:18,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:41:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:41:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:41:18,376 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 4 states. [2018-12-08 17:41:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:18,536 INFO L93 Difference]: Finished difference Result 159 states and 262 transitions. [2018-12-08 17:41:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:41:18,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-08 17:41:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:18,537 INFO L225 Difference]: With dead ends: 159 [2018-12-08 17:41:18,537 INFO L226 Difference]: Without dead ends: 127 [2018-12-08 17:41:18,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-08 17:41:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-12-08 17:41:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 17:41:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2018-12-08 17:41:18,546 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 27 [2018-12-08 17:41:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:18,547 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2018-12-08 17:41:18,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:41:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2018-12-08 17:41:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:41:18,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:18,548 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 17:41:18,548 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:18,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash -13869364, now seen corresponding path program 1 times [2018-12-08 17:41:18,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:41:18,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:18,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:41:18,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:41:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:41:18,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:41:18,604 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand 4 states. [2018-12-08 17:41:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:18,737 INFO L93 Difference]: Finished difference Result 245 states and 378 transitions. [2018-12-08 17:41:18,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:41:18,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-08 17:41:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:18,739 INFO L225 Difference]: With dead ends: 245 [2018-12-08 17:41:18,739 INFO L226 Difference]: Without dead ends: 174 [2018-12-08 17:41:18,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-08 17:41:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2018-12-08 17:41:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-08 17:41:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 188 transitions. [2018-12-08 17:41:18,746 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 188 transitions. Word has length 33 [2018-12-08 17:41:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:18,746 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 188 transitions. [2018-12-08 17:41:18,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:41:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 188 transitions. [2018-12-08 17:41:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 17:41:18,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:18,748 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-08 17:41:18,748 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:18,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1417056703, now seen corresponding path program 1 times [2018-12-08 17:41:18,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:18,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:18,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:18,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 17:41:18,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:18,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:41:18,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:41:18,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:41:18,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:18,795 INFO L87 Difference]: Start difference. First operand 124 states and 188 transitions. Second operand 5 states. [2018-12-08 17:41:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:18,948 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2018-12-08 17:41:18,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:41:18,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-08 17:41:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:18,950 INFO L225 Difference]: With dead ends: 346 [2018-12-08 17:41:18,950 INFO L226 Difference]: Without dead ends: 240 [2018-12-08 17:41:18,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-12-08 17:41:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 132. [2018-12-08 17:41:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-08 17:41:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2018-12-08 17:41:18,958 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 197 transitions. Word has length 39 [2018-12-08 17:41:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:18,958 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-12-08 17:41:18,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:41:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 197 transitions. [2018-12-08 17:41:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:41:18,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:18,959 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-08 17:41:18,959 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:18,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1068918534, now seen corresponding path program 1 times [2018-12-08 17:41:18,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:18,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:18,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:18,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 17:41:19,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:19,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:41:19,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:41:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:41:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:19,007 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. Second operand 5 states. [2018-12-08 17:41:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:19,161 INFO L93 Difference]: Finished difference Result 367 states and 553 transitions. [2018-12-08 17:41:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:41:19,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-08 17:41:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:19,162 INFO L225 Difference]: With dead ends: 367 [2018-12-08 17:41:19,163 INFO L226 Difference]: Without dead ends: 260 [2018-12-08 17:41:19,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-08 17:41:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 142. [2018-12-08 17:41:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-08 17:41:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 210 transitions. [2018-12-08 17:41:19,171 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 210 transitions. Word has length 40 [2018-12-08 17:41:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:19,171 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 210 transitions. [2018-12-08 17:41:19,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:41:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 210 transitions. [2018-12-08 17:41:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 17:41:19,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:19,172 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:19,172 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:19,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash 482670800, now seen corresponding path program 1 times [2018-12-08 17:41:19,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:19,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:19,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:19,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:41:19,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:41:19,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:41:19,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:19,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 17:41:19,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:41:19,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-12-08 17:41:19,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:41:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:41:19,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:41:19,312 INFO L87 Difference]: Start difference. First operand 142 states and 210 transitions. Second operand 7 states. [2018-12-08 17:41:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:19,988 INFO L93 Difference]: Finished difference Result 335 states and 526 transitions. [2018-12-08 17:41:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:41:19,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-08 17:41:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:19,989 INFO L225 Difference]: With dead ends: 335 [2018-12-08 17:41:19,989 INFO L226 Difference]: Without dead ends: 227 [2018-12-08 17:41:19,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:41:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-08 17:41:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 184. [2018-12-08 17:41:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-08 17:41:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2018-12-08 17:41:19,995 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 41 [2018-12-08 17:41:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:19,995 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2018-12-08 17:41:19,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:41:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2018-12-08 17:41:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:41:19,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:19,996 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:19,997 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:19,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1878612609, now seen corresponding path program 1 times [2018-12-08 17:41:19,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:19,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 17:41:20,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:20,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:41:20,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:41:20,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:41:20,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:20,034 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand 6 states. [2018-12-08 17:41:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:20,285 INFO L93 Difference]: Finished difference Result 641 states and 855 transitions. [2018-12-08 17:41:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:41:20,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-08 17:41:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:20,287 INFO L225 Difference]: With dead ends: 641 [2018-12-08 17:41:20,287 INFO L226 Difference]: Without dead ends: 492 [2018-12-08 17:41:20,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:41:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-12-08 17:41:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 184. [2018-12-08 17:41:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-08 17:41:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2018-12-08 17:41:20,297 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 47 [2018-12-08 17:41:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:20,297 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2018-12-08 17:41:20,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:41:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2018-12-08 17:41:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:41:20,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:20,299 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:20,299 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:20,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1498452256, now seen corresponding path program 1 times [2018-12-08 17:41:20,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:20,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:20,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 17:41:20,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:20,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:41:20,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:41:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:41:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:20,342 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand 6 states. [2018-12-08 17:41:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:20,623 INFO L93 Difference]: Finished difference Result 625 states and 835 transitions. [2018-12-08 17:41:20,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:41:20,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-08 17:41:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:20,624 INFO L225 Difference]: With dead ends: 625 [2018-12-08 17:41:20,624 INFO L226 Difference]: Without dead ends: 477 [2018-12-08 17:41:20,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:41:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-08 17:41:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 396. [2018-12-08 17:41:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-08 17:41:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 540 transitions. [2018-12-08 17:41:20,633 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 540 transitions. Word has length 48 [2018-12-08 17:41:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:20,633 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 540 transitions. [2018-12-08 17:41:20,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:41:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 540 transitions. [2018-12-08 17:41:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:41:20,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:20,634 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2018-12-08 17:41:20,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:20,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash -211268504, now seen corresponding path program 1 times [2018-12-08 17:41:20,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:20,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:20,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 17:41:20,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:20,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:41:20,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:41:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:41:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:41:20,695 INFO L87 Difference]: Start difference. First operand 396 states and 540 transitions. Second operand 8 states. [2018-12-08 17:41:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:21,260 INFO L93 Difference]: Finished difference Result 2003 states and 2787 transitions. [2018-12-08 17:41:21,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:41:21,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-08 17:41:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:21,263 INFO L225 Difference]: With dead ends: 2003 [2018-12-08 17:41:21,263 INFO L226 Difference]: Without dead ends: 1601 [2018-12-08 17:41:21,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:41:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2018-12-08 17:41:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1231. [2018-12-08 17:41:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-12-08 17:41:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1711 transitions. [2018-12-08 17:41:21,291 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1711 transitions. Word has length 49 [2018-12-08 17:41:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:21,291 INFO L480 AbstractCegarLoop]: Abstraction has 1231 states and 1711 transitions. [2018-12-08 17:41:21,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:41:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1711 transitions. [2018-12-08 17:41:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 17:41:21,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:21,292 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:21,293 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:21,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash 968985203, now seen corresponding path program 1 times [2018-12-08 17:41:21,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:21,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:21,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:21,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:41:21,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:21,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:41:21,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:41:21,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:41:21,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:41:21,332 INFO L87 Difference]: Start difference. First operand 1231 states and 1711 transitions. Second operand 4 states. [2018-12-08 17:41:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:21,431 INFO L93 Difference]: Finished difference Result 1698 states and 2357 transitions. [2018-12-08 17:41:21,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:41:21,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-08 17:41:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:21,433 INFO L225 Difference]: With dead ends: 1698 [2018-12-08 17:41:21,434 INFO L226 Difference]: Without dead ends: 1249 [2018-12-08 17:41:21,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2018-12-08 17:41:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1243. [2018-12-08 17:41:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2018-12-08 17:41:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1692 transitions. [2018-12-08 17:41:21,458 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1692 transitions. Word has length 54 [2018-12-08 17:41:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:21,458 INFO L480 AbstractCegarLoop]: Abstraction has 1243 states and 1692 transitions. [2018-12-08 17:41:21,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:41:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1692 transitions. [2018-12-08 17:41:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:41:21,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:21,459 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:21,460 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:21,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash 752188361, now seen corresponding path program 1 times [2018-12-08 17:41:21,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:21,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:21,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:21,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:21,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 17:41:21,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:41:21,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:41:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:21,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:41:21,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:41:21,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-12-08 17:41:21,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:41:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:41:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:41:21,637 INFO L87 Difference]: Start difference. First operand 1243 states and 1692 transitions. Second operand 10 states. [2018-12-08 17:41:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:22,325 INFO L93 Difference]: Finished difference Result 2808 states and 3815 transitions. [2018-12-08 17:41:22,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:41:22,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-08 17:41:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:22,328 INFO L225 Difference]: With dead ends: 2808 [2018-12-08 17:41:22,328 INFO L226 Difference]: Without dead ends: 1553 [2018-12-08 17:41:22,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:41:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2018-12-08 17:41:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1279. [2018-12-08 17:41:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-08 17:41:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1694 transitions. [2018-12-08 17:41:22,356 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1694 transitions. Word has length 55 [2018-12-08 17:41:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:22,356 INFO L480 AbstractCegarLoop]: Abstraction has 1279 states and 1694 transitions. [2018-12-08 17:41:22,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:41:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1694 transitions. [2018-12-08 17:41:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:41:22,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:22,358 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:22,358 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:22,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1415790296, now seen corresponding path program 1 times [2018-12-08 17:41:22,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:22,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:22,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 17:41:22,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:22,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:41:22,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:41:22,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:41:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:41:22,440 INFO L87 Difference]: Start difference. First operand 1279 states and 1694 transitions. Second operand 9 states. [2018-12-08 17:41:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:22,940 INFO L93 Difference]: Finished difference Result 2987 states and 3987 transitions. [2018-12-08 17:41:22,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:41:22,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-12-08 17:41:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:22,944 INFO L225 Difference]: With dead ends: 2987 [2018-12-08 17:41:22,944 INFO L226 Difference]: Without dead ends: 1932 [2018-12-08 17:41:22,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:41:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2018-12-08 17:41:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1643. [2018-12-08 17:41:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2018-12-08 17:41:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2152 transitions. [2018-12-08 17:41:22,975 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2152 transitions. Word has length 56 [2018-12-08 17:41:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:22,976 INFO L480 AbstractCegarLoop]: Abstraction has 1643 states and 2152 transitions. [2018-12-08 17:41:22,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:41:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2152 transitions. [2018-12-08 17:41:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:41:22,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:22,977 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:22,977 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:22,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:22,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1038259591, now seen corresponding path program 1 times [2018-12-08 17:41:22,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:22,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:22,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:41:23,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:23,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:41:23,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:41:23,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:41:23,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:41:23,016 INFO L87 Difference]: Start difference. First operand 1643 states and 2152 transitions. Second operand 4 states. [2018-12-08 17:41:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:23,103 INFO L93 Difference]: Finished difference Result 2184 states and 2863 transitions. [2018-12-08 17:41:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:41:23,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-08 17:41:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:23,107 INFO L225 Difference]: With dead ends: 2184 [2018-12-08 17:41:23,107 INFO L226 Difference]: Without dead ends: 1678 [2018-12-08 17:41:23,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2018-12-08 17:41:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1644. [2018-12-08 17:41:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2018-12-08 17:41:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2133 transitions. [2018-12-08 17:41:23,153 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2133 transitions. Word has length 58 [2018-12-08 17:41:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:23,154 INFO L480 AbstractCegarLoop]: Abstraction has 1644 states and 2133 transitions. [2018-12-08 17:41:23,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:41:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2133 transitions. [2018-12-08 17:41:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 17:41:23,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:23,155 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:23,155 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:23,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:23,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1793263524, now seen corresponding path program 1 times [2018-12-08 17:41:23,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:23,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:23,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:23,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 17:41:23,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:41:23,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:41:23,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:23,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:41:23,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:41:23,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2018-12-08 17:41:23,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:41:23,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:41:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:41:23,315 INFO L87 Difference]: Start difference. First operand 1644 states and 2133 transitions. Second operand 10 states. [2018-12-08 17:41:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:23,984 INFO L93 Difference]: Finished difference Result 2532 states and 3267 transitions. [2018-12-08 17:41:23,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 17:41:23,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-12-08 17:41:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:23,986 INFO L225 Difference]: With dead ends: 2532 [2018-12-08 17:41:23,986 INFO L226 Difference]: Without dead ends: 1883 [2018-12-08 17:41:23,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-12-08 17:41:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-12-08 17:41:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1651. [2018-12-08 17:41:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-12-08 17:41:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2121 transitions. [2018-12-08 17:41:24,012 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2121 transitions. Word has length 59 [2018-12-08 17:41:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:24,012 INFO L480 AbstractCegarLoop]: Abstraction has 1651 states and 2121 transitions. [2018-12-08 17:41:24,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:41:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2121 transitions. [2018-12-08 17:41:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:41:24,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:24,013 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:24,013 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:24,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:24,014 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2018-12-08 17:41:24,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:41:24,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:41:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:24,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:41:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:41:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:41:24,040 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:41:24,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:41:24 BoogieIcfgContainer [2018-12-08 17:41:24,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:41:24,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:41:24,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:41:24,073 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:41:24,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:41:17" (3/4) ... [2018-12-08 17:41:24,076 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 17:41:24,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:41:24,077 INFO L168 Benchmark]: Toolchain (without parser) took 6555.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 954.4 MB in the beginning and 976.4 MB in the end (delta: -22.0 MB). Peak memory consumption was 166.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:41:24,078 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:41:24,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.88 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:41:24,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-08 17:41:24,079 INFO L168 Benchmark]: Boogie Preprocessor took 20.97 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:41:24,079 INFO L168 Benchmark]: RCFGBuilder took 189.17 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:41:24,079 INFO L168 Benchmark]: TraceAbstraction took 6122.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 124.6 MB). Peak memory consumption was 188.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:41:24,080 INFO L168 Benchmark]: Witness Printer took 3.18 ms. Allocated memory is still 1.2 GB. Free memory is still 976.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:41:24,082 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.88 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.97 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 189.17 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6122.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 124.6 MB). Peak memory consumption was 188.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.18 ms. Allocated memory is still 1.2 GB. Free memory is still 976.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 97. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL, EXPR mp_add(a, b) VAL [\old(a)=0, \old(b)=0] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L90] COND TRUE i == (unsigned char)1 [L90] r1 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; VAL [\old(a)=0, \old(b)=0, \result=1, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r=1, r0=0, r1=0, r2=0, r3=0] [L110] RET, EXPR mp_add(a, b) VAL [a=0, b=0, mp_add(a, b)=1] [L110] r = mp_add(a, b) [L112] CALL __VERIFIER_assert(r == a + b) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 1 error locations. UNSAFE Result, 6.0s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1244 SDtfs, 2646 SDslu, 2753 SDs, 0 SdLazy, 5130 SolverSat, 502 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 176 SyntacticMatches, 11 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1651occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 1951 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 863 NumberOfCodeBlocks, 863 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 785 ConstructedInterpolants, 41 QuantifiedInterpolants, 159396 SizeOfPredicates, 7 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 361/367 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:41:25,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:41:25,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:41:25,355 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:41:25,355 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:41:25,356 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:41:25,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:41:25,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:41:25,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:41:25,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:41:25,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:41:25,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:41:25,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:41:25,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:41:25,360 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:41:25,360 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:41:25,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:41:25,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:41:25,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:41:25,363 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:41:25,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:41:25,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:41:25,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:41:25,365 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:41:25,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:41:25,366 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:41:25,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:41:25,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:41:25,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:41:25,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:41:25,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:41:25,368 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:41:25,368 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:41:25,368 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:41:25,369 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:41:25,369 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:41:25,369 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-08 17:41:25,376 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:41:25,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:41:25,377 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:41:25,377 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:41:25,377 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:41:25,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 17:41:25,378 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 17:41:25,378 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:41:25,379 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:41:25,379 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:41:25,379 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:41:25,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:41:25,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:41:25,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:41:25,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:41:25,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:41:25,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:41:25,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:41:25,380 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:41:25,380 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-08 17:41:25,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:41:25,380 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 17:41:25,380 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 17:41:25,380 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-12-08 17:41:25,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:41:25,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:41:25,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:41:25,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:41:25,408 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:41:25,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-08 17:41:25,445 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data/5d151cf90/9046bf08b4f54d57a414b8508b8a44ef/FLAG8c790a506 [2018-12-08 17:41:25,800 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:41:25,800 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-08 17:41:25,805 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data/5d151cf90/9046bf08b4f54d57a414b8508b8a44ef/FLAG8c790a506 [2018-12-08 17:41:26,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/data/5d151cf90/9046bf08b4f54d57a414b8508b8a44ef [2018-12-08 17:41:26,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:41:26,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:41:26,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:41:26,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:41:26,186 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:41:26,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63407dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26, skipping insertion in model container [2018-12-08 17:41:26,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:41:26,210 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:41:26,316 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:41:26,319 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:41:26,342 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:41:26,352 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:41:26,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26 WrapperNode [2018-12-08 17:41:26,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:41:26,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:41:26,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:41:26,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:41:26,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:41:26,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:41:26,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:41:26,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:41:26,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... [2018-12-08 17:41:26,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:41:26,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:41:26,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:41:26,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:41:26,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-08 17:41:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-08 17:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:41:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:41:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:41:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:41:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 17:41:26,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 17:41:26,622 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:41:26,622 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 17:41:26,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:41:26 BoogieIcfgContainer [2018-12-08 17:41:26,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:41:26,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:41:26,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:41:26,625 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:41:26,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:41:26" (1/3) ... [2018-12-08 17:41:26,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ebbe8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:41:26, skipping insertion in model container [2018-12-08 17:41:26,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:41:26" (2/3) ... [2018-12-08 17:41:26,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ebbe8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:41:26, skipping insertion in model container [2018-12-08 17:41:26,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:41:26" (3/3) ... [2018-12-08 17:41:26,627 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-08 17:41:26,635 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:41:26,639 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 17:41:26,650 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 17:41:26,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:41:26,667 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:41:26,668 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:41:26,668 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:41:26,668 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:41:26,668 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:41:26,668 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:41:26,668 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:41:26,668 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:41:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-08 17:41:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:41:26,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:26,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:26,683 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:26,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:26,687 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2018-12-08 17:41:26,689 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:26,689 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:26,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:26,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:26,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:26,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:26,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:41:26,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 17:41:26,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 17:41:26,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:41:26,761 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-08 17:41:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:26,779 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2018-12-08 17:41:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 17:41:26,780 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-08 17:41:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:26,785 INFO L225 Difference]: With dead ends: 76 [2018-12-08 17:41:26,785 INFO L226 Difference]: Without dead ends: 47 [2018-12-08 17:41:26,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:41:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-08 17:41:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-08 17:41:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 17:41:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-12-08 17:41:26,809 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-12-08 17:41:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:26,810 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-12-08 17:41:26,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 17:41:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-12-08 17:41:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:41:26,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:26,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:26,811 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:26,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2018-12-08 17:41:26,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:26,811 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:26,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:26,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:26,875 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:26,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:26,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:41:26,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:41:26,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:41:26,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:41:26,878 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 4 states. [2018-12-08 17:41:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:26,968 INFO L93 Difference]: Finished difference Result 127 states and 213 transitions. [2018-12-08 17:41:26,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:41:26,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-08 17:41:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:26,970 INFO L225 Difference]: With dead ends: 127 [2018-12-08 17:41:26,970 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 17:41:26,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:41:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 17:41:26,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-12-08 17:41:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-08 17:41:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-12-08 17:41:26,979 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 21 [2018-12-08 17:41:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:26,979 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2018-12-08 17:41:26,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:41:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-12-08 17:41:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:41:26,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:26,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:26,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:26,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1988705185, now seen corresponding path program 1 times [2018-12-08 17:41:26,981 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:26,981 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:26,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:27,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:27,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:27,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:27,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:41:27,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:41:27,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:41:27,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:27,047 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand 5 states. [2018-12-08 17:41:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:27,239 INFO L93 Difference]: Finished difference Result 173 states and 282 transitions. [2018-12-08 17:41:27,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:41:27,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-08 17:41:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:27,241 INFO L225 Difference]: With dead ends: 173 [2018-12-08 17:41:27,241 INFO L226 Difference]: Without dead ends: 141 [2018-12-08 17:41:27,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-08 17:41:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 90. [2018-12-08 17:41:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-08 17:41:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-12-08 17:41:27,248 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 22 [2018-12-08 17:41:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:27,248 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2018-12-08 17:41:27,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:41:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-12-08 17:41:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 17:41:27,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:27,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:27,249 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:27,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1386022735, now seen corresponding path program 1 times [2018-12-08 17:41:27,249 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:27,250 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:27,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:27,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:27,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:27,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:27,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:41:27,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:41:27,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:41:27,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:41:27,320 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand 7 states. [2018-12-08 17:41:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:27,456 INFO L93 Difference]: Finished difference Result 215 states and 343 transitions. [2018-12-08 17:41:27,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:41:27,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-08 17:41:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:27,457 INFO L225 Difference]: With dead ends: 215 [2018-12-08 17:41:27,457 INFO L226 Difference]: Without dead ends: 183 [2018-12-08 17:41:27,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:41:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-08 17:41:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2018-12-08 17:41:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-08 17:41:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 183 transitions. [2018-12-08 17:41:27,465 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 183 transitions. Word has length 23 [2018-12-08 17:41:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:27,465 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 183 transitions. [2018-12-08 17:41:27,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:41:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 183 transitions. [2018-12-08 17:41:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 17:41:27,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:27,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:27,466 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:27,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:27,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1127857297, now seen corresponding path program 1 times [2018-12-08 17:41:27,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:27,467 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:27,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:27,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:27,516 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:27,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:27,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:41:27,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:41:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:41:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:27,518 INFO L87 Difference]: Start difference. First operand 120 states and 183 transitions. Second operand 6 states. [2018-12-08 17:41:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:27,694 INFO L93 Difference]: Finished difference Result 234 states and 364 transitions. [2018-12-08 17:41:27,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:41:27,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-08 17:41:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:27,695 INFO L225 Difference]: With dead ends: 234 [2018-12-08 17:41:27,696 INFO L226 Difference]: Without dead ends: 202 [2018-12-08 17:41:27,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-08 17:41:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 96. [2018-12-08 17:41:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 17:41:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2018-12-08 17:41:27,702 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 23 [2018-12-08 17:41:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:27,702 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2018-12-08 17:41:27,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:41:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2018-12-08 17:41:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:41:27,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:27,703 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-12-08 17:41:27,703 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:27,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash 214387631, now seen corresponding path program 1 times [2018-12-08 17:41:27,704 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:27,704 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:27,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:27,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:27,752 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:27,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:27,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:41:27,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:41:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:41:27,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:41:27,754 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand 4 states. [2018-12-08 17:41:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:27,833 INFO L93 Difference]: Finished difference Result 254 states and 370 transitions. [2018-12-08 17:41:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:41:27,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-08 17:41:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:27,834 INFO L225 Difference]: With dead ends: 254 [2018-12-08 17:41:27,835 INFO L226 Difference]: Without dead ends: 180 [2018-12-08 17:41:27,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:41:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-08 17:41:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 106. [2018-12-08 17:41:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 17:41:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-12-08 17:41:27,844 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 34 [2018-12-08 17:41:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:27,844 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-12-08 17:41:27,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:41:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-12-08 17:41:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:41:27,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:27,846 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-12-08 17:41:27,846 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:27,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:27,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1041972219, now seen corresponding path program 1 times [2018-12-08 17:41:27,847 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:27,847 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:27,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:27,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:27,905 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:27,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:27,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:41:27,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:41:27,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:41:27,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:27,907 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 5 states. [2018-12-08 17:41:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:27,984 INFO L93 Difference]: Finished difference Result 334 states and 488 transitions. [2018-12-08 17:41:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:41:27,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-08 17:41:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:27,986 INFO L225 Difference]: With dead ends: 334 [2018-12-08 17:41:27,986 INFO L226 Difference]: Without dead ends: 260 [2018-12-08 17:41:27,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:41:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-08 17:41:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2018-12-08 17:41:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 17:41:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-12-08 17:41:27,996 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 35 [2018-12-08 17:41:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:27,996 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-12-08 17:41:27,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:41:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-12-08 17:41:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:41:27,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:27,997 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-12-08 17:41:27,997 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:27,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:27,998 INFO L82 PathProgramCache]: Analyzing trace with hash 919023332, now seen corresponding path program 1 times [2018-12-08 17:41:27,998 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:27,998 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:28,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:28,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:28,073 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:28,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:28,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:41:28,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:41:28,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:41:28,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:41:28,075 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 7 states. [2018-12-08 17:41:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:28,169 INFO L93 Difference]: Finished difference Result 408 states and 594 transitions. [2018-12-08 17:41:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:41:28,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-08 17:41:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:28,170 INFO L225 Difference]: With dead ends: 408 [2018-12-08 17:41:28,170 INFO L226 Difference]: Without dead ends: 334 [2018-12-08 17:41:28,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:41:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-08 17:41:28,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 166. [2018-12-08 17:41:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-08 17:41:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2018-12-08 17:41:28,177 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 36 [2018-12-08 17:41:28,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:28,178 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2018-12-08 17:41:28,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:41:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2018-12-08 17:41:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:41:28,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:28,178 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-12-08 17:41:28,179 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:28,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:28,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1452715930, now seen corresponding path program 1 times [2018-12-08 17:41:28,179 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:28,179 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:28,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:28,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:28,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:41:28,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:41:28,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:41:28,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:41:28,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:41:28,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:28,241 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand 6 states. [2018-12-08 17:41:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:28,375 INFO L93 Difference]: Finished difference Result 406 states and 588 transitions. [2018-12-08 17:41:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:41:28,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-08 17:41:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:28,376 INFO L225 Difference]: With dead ends: 406 [2018-12-08 17:41:28,376 INFO L226 Difference]: Without dead ends: 332 [2018-12-08 17:41:28,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-08 17:41:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 156. [2018-12-08 17:41:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-08 17:41:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 221 transitions. [2018-12-08 17:41:28,383 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 221 transitions. Word has length 36 [2018-12-08 17:41:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:28,384 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 221 transitions. [2018-12-08 17:41:28,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:41:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 221 transitions. [2018-12-08 17:41:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:41:28,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:28,384 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:28,385 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:28,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:28,385 INFO L82 PathProgramCache]: Analyzing trace with hash 617124283, now seen corresponding path program 1 times [2018-12-08 17:41:28,385 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:28,385 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:28,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:28,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:28,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:41:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:28,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:41:28,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 17:41:28,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:41:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:41:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:41:28,476 INFO L87 Difference]: Start difference. First operand 156 states and 221 transitions. Second operand 8 states. [2018-12-08 17:41:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:28,834 INFO L93 Difference]: Finished difference Result 531 states and 806 transitions. [2018-12-08 17:41:28,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:41:28,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-12-08 17:41:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:28,836 INFO L225 Difference]: With dead ends: 531 [2018-12-08 17:41:28,836 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 17:41:28,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:41:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 17:41:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 395. [2018-12-08 17:41:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-08 17:41:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 566 transitions. [2018-12-08 17:41:28,847 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 566 transitions. Word has length 38 [2018-12-08 17:41:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:28,848 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 566 transitions. [2018-12-08 17:41:28,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:41:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 566 transitions. [2018-12-08 17:41:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:41:28,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:28,849 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:28,849 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:28,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1319658960, now seen corresponding path program 1 times [2018-12-08 17:41:28,849 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:28,849 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:28,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:28,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:28,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:41:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:28,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:41:28,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 17:41:28,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:41:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:41:28,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:41:28,930 INFO L87 Difference]: Start difference. First operand 395 states and 566 transitions. Second operand 8 states. [2018-12-08 17:41:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:29,355 INFO L93 Difference]: Finished difference Result 1332 states and 1992 transitions. [2018-12-08 17:41:29,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:41:29,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-08 17:41:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:29,359 INFO L225 Difference]: With dead ends: 1332 [2018-12-08 17:41:29,359 INFO L226 Difference]: Without dead ends: 1122 [2018-12-08 17:41:29,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:41:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2018-12-08 17:41:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 885. [2018-12-08 17:41:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-08 17:41:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1279 transitions. [2018-12-08 17:41:29,412 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1279 transitions. Word has length 40 [2018-12-08 17:41:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:29,412 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1279 transitions. [2018-12-08 17:41:29,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:41:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1279 transitions. [2018-12-08 17:41:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 17:41:29,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:29,413 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:29,413 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:29,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash -677622459, now seen corresponding path program 1 times [2018-12-08 17:41:29,414 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:29,414 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:29,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:29,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:29,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:41:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:41:29,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:41:29,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-08 17:41:29,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:41:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:41:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:41:29,521 INFO L87 Difference]: Start difference. First operand 885 states and 1279 transitions. Second operand 6 states. [2018-12-08 17:41:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:41:29,730 INFO L93 Difference]: Finished difference Result 1637 states and 2529 transitions. [2018-12-08 17:41:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:41:29,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-12-08 17:41:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:41:29,733 INFO L225 Difference]: With dead ends: 1637 [2018-12-08 17:41:29,733 INFO L226 Difference]: Without dead ends: 1359 [2018-12-08 17:41:29,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:41:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2018-12-08 17:41:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1180. [2018-12-08 17:41:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2018-12-08 17:41:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1770 transitions. [2018-12-08 17:41:29,769 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1770 transitions. Word has length 42 [2018-12-08 17:41:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:41:29,769 INFO L480 AbstractCegarLoop]: Abstraction has 1180 states and 1770 transitions. [2018-12-08 17:41:29,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:41:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1770 transitions. [2018-12-08 17:41:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:41:29,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:41:29,770 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:41:29,770 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:41:29,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:41:29,770 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2018-12-08 17:41:29,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:41:29,770 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:41:29,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:41:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:41:29,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:41:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 17:41:30,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:41:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 17:41:33,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:41:33,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-12-08 17:41:33,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-08 17:41:33,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-08 17:41:33,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2018-12-08 17:41:33,480 INFO L87 Difference]: Start difference. First operand 1180 states and 1770 transitions. Second operand 44 states. [2018-12-08 17:41:54,439 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-08 17:41:56,460 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2018-12-08 17:41:57,222 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-08 17:41:57,825 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-08 17:42:01,394 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-08 17:42:02,045 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-08 17:42:02,357 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-12-08 17:42:03,018 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-12-08 17:42:03,389 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-12-08 17:42:04,292 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-12-08 17:42:04,724 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-08 17:42:05,233 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-08 17:42:05,521 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-12-08 17:42:05,943 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-08 17:42:06,819 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-12-08 17:42:07,740 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-12-08 17:42:08,069 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-12-08 17:42:09,322 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-12-08 17:42:09,704 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-12-08 17:42:10,683 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-08 17:42:12,649 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-08 17:42:13,109 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-08 17:42:13,828 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-08 17:42:14,200 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-12-08 17:42:15,195 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-12-08 17:42:15,613 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-08 17:42:16,162 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2018-12-08 17:42:17,544 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-12-08 17:42:17,872 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2018-12-08 17:42:18,997 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-12-08 17:42:20,654 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-12-08 17:42:21,049 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-08 17:42:21,410 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 99 [2018-12-08 17:42:22,041 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2018-12-08 17:42:23,769 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-08 17:42:25,244 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-12-08 17:42:25,612 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-08 17:42:26,015 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-12-08 17:42:27,609 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2018-12-08 17:42:28,264 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-08 17:42:28,656 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-08 17:42:29,575 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-12-08 17:42:30,152 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-12-08 17:42:30,901 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-12-08 17:42:31,342 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-12-08 17:42:31,801 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-08 17:42:32,456 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-08 17:42:33,241 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2018-12-08 17:42:34,959 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-12-08 17:42:35,466 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-08 17:42:36,554 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 120 [2018-12-08 17:42:37,169 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-08 17:42:37,502 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-08 17:42:38,481 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-08 17:42:38,788 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-08 17:42:39,209 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-08 17:42:40,354 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-12-08 17:42:41,277 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-08 17:42:41,756 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-08 17:42:42,638 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 119 [2018-12-08 17:42:45,034 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-12-08 17:42:45,501 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-08 17:42:46,637 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 123 [2018-12-08 17:42:47,539 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2018-12-08 17:42:47,944 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-08 17:42:48,394 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-12-08 17:42:49,965 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-12-08 17:42:50,471 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-12-08 17:42:51,275 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 122 [2018-12-08 17:42:51,994 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2018-12-08 17:42:52,424 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-08 17:42:53,308 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2018-12-08 17:42:53,685 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-12-08 17:42:54,132 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-12-08 17:42:54,931 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-08 17:42:55,264 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-08 17:42:55,754 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-12-08 17:42:56,321 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-12-08 17:42:56,868 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2018-12-08 17:42:58,321 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-08 17:42:58,773 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-08 17:42:59,202 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-08 17:42:59,760 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2018-12-08 17:43:00,456 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 108 [2018-12-08 17:43:00,859 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-08 17:43:01,320 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2018-12-08 17:43:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:43:01,423 INFO L93 Difference]: Finished difference Result 10401 states and 15820 transitions. [2018-12-08 17:43:01,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2018-12-08 17:43:01,424 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 60 [2018-12-08 17:43:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:43:01,452 INFO L225 Difference]: With dead ends: 10401 [2018-12-08 17:43:01,452 INFO L226 Difference]: Without dead ends: 10205 [2018-12-08 17:43:01,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32087 ImplicationChecksByTransitivity, 71.5s TimeCoverageRelationStatistics Valid=18847, Invalid=70853, Unknown=0, NotChecked=0, Total=89700 [2018-12-08 17:43:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10205 states. [2018-12-08 17:43:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10205 to 4459. [2018-12-08 17:43:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4459 states. [2018-12-08 17:43:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 6911 transitions. [2018-12-08 17:43:01,649 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 6911 transitions. Word has length 60 [2018-12-08 17:43:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:43:01,650 INFO L480 AbstractCegarLoop]: Abstraction has 4459 states and 6911 transitions. [2018-12-08 17:43:01,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-08 17:43:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 6911 transitions. [2018-12-08 17:43:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:43:01,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:43:01,651 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:43:01,652 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:43:01,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:43:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1987160410, now seen corresponding path program 1 times [2018-12-08 17:43:01,652 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:43:01,652 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:43:01,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:43:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:43:01,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:43:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:43:01,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:43:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:43:01,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:43:01,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2018-12-08 17:43:01,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:43:01,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:43:01,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:43:01,749 INFO L87 Difference]: Start difference. First operand 4459 states and 6911 transitions. Second operand 8 states. [2018-12-08 17:43:02,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:43:02,442 INFO L93 Difference]: Finished difference Result 10009 states and 15546 transitions. [2018-12-08 17:43:02,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 17:43:02,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-08 17:43:02,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:43:02,451 INFO L225 Difference]: With dead ends: 10009 [2018-12-08 17:43:02,451 INFO L226 Difference]: Without dead ends: 5616 [2018-12-08 17:43:02,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:43:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2018-12-08 17:43:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 4815. [2018-12-08 17:43:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2018-12-08 17:43:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 7218 transitions. [2018-12-08 17:43:02,611 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 7218 transitions. Word has length 60 [2018-12-08 17:43:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:43:02,611 INFO L480 AbstractCegarLoop]: Abstraction has 4815 states and 7218 transitions. [2018-12-08 17:43:02,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:43:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 7218 transitions. [2018-12-08 17:43:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:43:02,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:43:02,612 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:43:02,612 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:43:02,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:43:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1930321118, now seen corresponding path program 1 times [2018-12-08 17:43:02,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:43:02,612 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:43:02,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:43:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:43:02,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:43:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 17:43:02,659 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:43:02,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:43:02,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:43:02,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:43:02,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:43:02,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:43:02,662 INFO L87 Difference]: Start difference. First operand 4815 states and 7218 transitions. Second operand 3 states. [2018-12-08 17:43:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:43:02,829 INFO L93 Difference]: Finished difference Result 5669 states and 8305 transitions. [2018-12-08 17:43:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:43:02,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-08 17:43:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:43:02,836 INFO L225 Difference]: With dead ends: 5669 [2018-12-08 17:43:02,836 INFO L226 Difference]: Without dead ends: 5610 [2018-12-08 17:43:02,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:43:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2018-12-08 17:43:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5123. [2018-12-08 17:43:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5123 states. [2018-12-08 17:43:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5123 states to 5123 states and 7636 transitions. [2018-12-08 17:43:02,993 INFO L78 Accepts]: Start accepts. Automaton has 5123 states and 7636 transitions. Word has length 60 [2018-12-08 17:43:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:43:02,993 INFO L480 AbstractCegarLoop]: Abstraction has 5123 states and 7636 transitions. [2018-12-08 17:43:02,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:43:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 5123 states and 7636 transitions. [2018-12-08 17:43:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:43:02,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:43:02,994 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:43:02,994 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:43:02,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:43:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash -666750562, now seen corresponding path program 1 times [2018-12-08 17:43:02,995 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:43:02,995 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:43:03,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:43:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:43:03,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:43:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 17:43:03,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:43:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 17:43:03,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:43:03,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-08 17:43:03,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:43:03,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:43:03,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:43:03,146 INFO L87 Difference]: Start difference. First operand 5123 states and 7636 transitions. Second operand 12 states. [2018-12-08 17:43:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:43:04,322 INFO L93 Difference]: Finished difference Result 8814 states and 13182 transitions. [2018-12-08 17:43:04,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:43:04,322 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-12-08 17:43:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:43:04,328 INFO L225 Difference]: With dead ends: 8814 [2018-12-08 17:43:04,328 INFO L226 Difference]: Without dead ends: 6065 [2018-12-08 17:43:04,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:43:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2018-12-08 17:43:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 5218. [2018-12-08 17:43:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2018-12-08 17:43:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 7607 transitions. [2018-12-08 17:43:04,521 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 7607 transitions. Word has length 60 [2018-12-08 17:43:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:43:04,521 INFO L480 AbstractCegarLoop]: Abstraction has 5218 states and 7607 transitions. [2018-12-08 17:43:04,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:43:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7607 transitions. [2018-12-08 17:43:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 17:43:04,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:43:04,522 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:43:04,522 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:43:04,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:43:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1543067804, now seen corresponding path program 1 times [2018-12-08 17:43:04,523 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:43:04,523 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:43:04,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:43:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:43:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:43:04,626 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:43:04,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:43:04 BoogieIcfgContainer [2018-12-08 17:43:04,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:43:04,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:43:04,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:43:04,672 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:43:04,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:41:26" (3/4) ... [2018-12-08 17:43:04,674 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:43:04,739 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e532af3a-8676-493d-ae99-e382b8d2ea77/bin-2019/uautomizer/witness.graphml [2018-12-08 17:43:04,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:43:04,740 INFO L168 Benchmark]: Toolchain (without parser) took 98557.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.1 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -66.1 MB). Peak memory consumption was 196.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:43:04,740 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:43:04,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.36 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 927.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:43:04,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.85 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:43:04,741 INFO L168 Benchmark]: Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:43:04,741 INFO L168 Benchmark]: RCFGBuilder took 236.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-08 17:43:04,741 INFO L168 Benchmark]: TraceAbstraction took 98048.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.6 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:43:04,741 INFO L168 Benchmark]: Witness Printer took 67.31 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 793.7 kB). Peak memory consumption was 793.7 kB. Max. memory is 11.5 GB. [2018-12-08 17:43:04,742 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.36 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 927.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.85 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98048.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.6 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. * Witness Printer took 67.31 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 793.7 kB). Peak memory consumption was 793.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL, EXPR mp_add(a, b) VAL [\old(a)=35, \old(b)=220] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L70] COND TRUE i < nb VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L85] i = i + (unsigned char)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L64] COND FALSE !(i < na) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L70] COND FALSE !(i < nb) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L85] i = i + (unsigned char)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; VAL [\old(a)=35, \old(b)=220, \result=511, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r=511, r0=-1, r1=1, r2=0, r3=0] [L110] RET, EXPR mp_add(a, b) VAL [a=35, b=220, mp_add(a, b)=511] [L110] r = mp_add(a, b) [L112] CALL __VERIFIER_assert(r == a + b) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 1 error locations. UNSAFE Result, 98.0s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 92.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1916 SDtfs, 6254 SDslu, 9707 SDs, 0 SdLazy, 15633 SolverSat, 1216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1175 GetRequests, 788 SyntacticMatches, 4 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32199 ImplicationChecksByTransitivity, 72.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5218occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 9154 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 674 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 889 ConstructedInterpolants, 0 QuantifiedInterpolants, 363706 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1133 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 125/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...