./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/config/TaipanReach.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_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan --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 Taipan --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_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/config/TaipanReach.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_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan --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 Taipan --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-5842f4b [2018-11-18 10:58:52,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:58:52,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:58:52,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:58:52,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:58:52,491 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:58:52,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:58:52,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:58:52,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:58:52,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:58:52,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:58:52,495 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:58:52,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:58:52,497 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:58:52,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:58:52,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:58:52,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:58:52,500 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:58:52,501 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:58:52,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:58:52,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:58:52,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:58:52,505 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:58:52,505 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:58:52,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:58:52,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:58:52,507 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:58:52,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:58:52,508 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:58:52,509 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:58:52,509 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:58:52,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:58:52,510 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:58:52,510 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:58:52,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:58:52,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:58:52,512 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 10:58:52,522 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:58:52,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:58:52,523 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:58:52,523 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:58:52,523 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:58:52,523 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:58:52,523 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:58:52,523 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 10:58:52,524 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:58:52,524 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:58:52,524 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 10:58:52,524 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 10:58:52,524 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:58:52,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:58:52,525 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:58:52,525 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:58:52,525 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:58:52,525 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:58:52,525 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:58:52,525 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:58:52,525 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:58:52,526 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:58:52,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:58:52,526 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:58:52,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:58:52,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:58:52,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:58:52,528 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:58:52,528 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:58:52,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:58:52,528 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:58:52,529 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:58:52,529 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:58:52,529 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 10:58:52,529 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:58:52,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:58:52,529 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 10:58:52,529 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan 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 -> Taipan 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-11-18 10:58:52,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:58:52,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:58:52,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:58:52,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:58:52,569 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:58:52,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 10:58:52,614 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data/1f0af3c6f/9956f4795b3243bcb6b13f442edb29c9/FLAG99a9a1a66 [2018-11-18 10:58:52,961 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:58:52,962 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 10:58:52,978 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data/1f0af3c6f/9956f4795b3243bcb6b13f442edb29c9/FLAG99a9a1a66 [2018-11-18 10:58:53,379 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data/1f0af3c6f/9956f4795b3243bcb6b13f442edb29c9 [2018-11-18 10:58:53,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:58:53,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:58:53,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:58:53,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:58:53,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:58:53,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f98e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53, skipping insertion in model container [2018-11-18 10:58:53,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:58:53,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:58:53,583 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:58:53,586 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:58:53,611 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:58:53,623 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:58:53,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53 WrapperNode [2018-11-18 10:58:53,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:58:53,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:58:53,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:58:53,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:58:53,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:58:53,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:58:53,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:58:53,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:58:53,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... [2018-11-18 10:58:53,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:58:53,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:58:53,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:58:53,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:58:53,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:58:53,786 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-18 10:58:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-18 10:58:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:58:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:58:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:58:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:58:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:58:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:58:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 10:58:53,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 10:58:54,152 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:58:54,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:58:54 BoogieIcfgContainer [2018-11-18 10:58:54,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:58:54,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:58:54,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:58:54,156 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:58:54,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:58:53" (1/3) ... [2018-11-18 10:58:54,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebfbead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:58:54, skipping insertion in model container [2018-11-18 10:58:54,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:53" (2/3) ... [2018-11-18 10:58:54,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebfbead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:58:54, skipping insertion in model container [2018-11-18 10:58:54,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:58:54" (3/3) ... [2018-11-18 10:58:54,159 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 10:58:54,167 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:58:54,174 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:58:54,186 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:58:54,209 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:58:54,209 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:58:54,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:58:54,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:58:54,210 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:58:54,210 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:58:54,210 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:58:54,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:58:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-18 10:58:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:58:54,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:54,227 INFO L375 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-11-18 10:58:54,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:54,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash -486194587, now seen corresponding path program 1 times [2018-11-18 10:58:54,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:54,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:54,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:54,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:54,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:58:54,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:54,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 10:58:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 10:58:54,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 10:58:54,347 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-18 10:58:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:54,366 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-11-18 10:58:54,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 10:58:54,367 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 10:58:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:54,375 INFO L225 Difference]: With dead ends: 79 [2018-11-18 10:58:54,375 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 10:58:54,377 INFO L604 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-11-18 10:58:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 10:58:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-18 10:58:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 10:58:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-11-18 10:58:54,408 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 21 [2018-11-18 10:58:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:54,409 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-18 10:58:54,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 10:58:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-11-18 10:58:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:58:54,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:54,410 INFO L375 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-11-18 10:58:54,410 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:54,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1212978296, now seen corresponding path program 1 times [2018-11-18 10:58:54,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:54,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:54,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:54,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:54,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:54,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,564 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 3 states. [2018-11-18 10:58:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:54,792 INFO L93 Difference]: Finished difference Result 108 states and 175 transitions. [2018-11-18 10:58:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:54,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:58:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:54,794 INFO L225 Difference]: With dead ends: 108 [2018-11-18 10:58:54,794 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 10:58:54,795 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 10:58:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-18 10:58:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 10:58:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-11-18 10:58:54,804 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 23 [2018-11-18 10:58:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:54,804 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-18 10:58:54,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2018-11-18 10:58:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 10:58:54,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:54,805 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:54,806 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:54,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:54,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2067837576, now seen corresponding path program 1 times [2018-11-18 10:58:54,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:54,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:54,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:54,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:54,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:58:54,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:54,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:58:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:58:54,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:58:54,906 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 4 states. [2018-11-18 10:58:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:55,320 INFO L93 Difference]: Finished difference Result 167 states and 270 transitions. [2018-11-18 10:58:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:58:55,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-18 10:58:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:55,322 INFO L225 Difference]: With dead ends: 167 [2018-11-18 10:58:55,322 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 10:58:55,322 INFO L604 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-11-18 10:58:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 10:58:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-11-18 10:58:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-18 10:58:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2018-11-18 10:58:55,332 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 30 [2018-11-18 10:58:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:55,332 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2018-11-18 10:58:55,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:58:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2018-11-18 10:58:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 10:58:55,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:55,333 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:55,334 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:55,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:55,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1088003788, now seen corresponding path program 1 times [2018-11-18 10:58:55,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:55,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:58:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:55,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:58:55,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:55,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:58:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:58:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:58:55,490 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand 4 states. [2018-11-18 10:58:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:55,719 INFO L93 Difference]: Finished difference Result 257 states and 390 transitions. [2018-11-18 10:58:55,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:58:55,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-18 10:58:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:55,720 INFO L225 Difference]: With dead ends: 257 [2018-11-18 10:58:55,720 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 10:58:55,721 INFO L604 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-11-18 10:58:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 10:58:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 132. [2018-11-18 10:58:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 10:58:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2018-11-18 10:58:55,731 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 37 [2018-11-18 10:58:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:55,731 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 196 transitions. [2018-11-18 10:58:55,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:58:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 196 transitions. [2018-11-18 10:58:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 10:58:55,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:55,732 INFO L375 BasicCegarLoop]: trace histogram [4, 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-11-18 10:58:55,732 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:55,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -817205964, now seen corresponding path program 1 times [2018-11-18 10:58:55,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:58:55,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:55,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:58:55,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:55,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:58:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:58:55,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:58:55,832 INFO L87 Difference]: Start difference. First operand 132 states and 196 transitions. Second operand 5 states. [2018-11-18 10:58:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:56,217 INFO L93 Difference]: Finished difference Result 372 states and 556 transitions. [2018-11-18 10:58:56,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:58:56,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 10:58:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:56,220 INFO L225 Difference]: With dead ends: 372 [2018-11-18 10:58:56,221 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 10:58:56,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:58:56,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 10:58:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 140. [2018-11-18 10:58:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 10:58:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2018-11-18 10:58:56,234 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 44 [2018-11-18 10:58:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:56,234 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2018-11-18 10:58:56,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:58:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2018-11-18 10:58:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 10:58:56,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:56,235 INFO L375 BasicCegarLoop]: trace histogram [4, 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-11-18 10:58:56,236 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:56,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1610975370, now seen corresponding path program 1 times [2018-11-18 10:58:56,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:56,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:56,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:56,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:56,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:58:56,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:56,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:58:56,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:56,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:58:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:58:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:58:56,334 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand 5 states. [2018-11-18 10:58:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:56,626 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-11-18 10:58:56,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:58:56,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-18 10:58:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:56,628 INFO L225 Difference]: With dead ends: 380 [2018-11-18 10:58:56,628 INFO L226 Difference]: Without dead ends: 267 [2018-11-18 10:58:56,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:58:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-18 10:58:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 153. [2018-11-18 10:58:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-18 10:58:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2018-11-18 10:58:56,639 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 45 [2018-11-18 10:58:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:56,640 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2018-11-18 10:58:56,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:58:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2018-11-18 10:58:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 10:58:56,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:56,641 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:58:56,642 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:56,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1012075515, now seen corresponding path program 1 times [2018-11-18 10:58:56,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:56,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:56,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:56,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:56,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:58:56,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:58:56,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:58:56,749 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-18 10:58:56,750 INFO L202 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [33], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:58:56,775 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:58:56,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:58:56,875 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:58:56,876 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 49 root evaluator evaluations with a maximum evaluation depth of 3. Performed 49 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:58:56,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:56,883 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:58:56,927 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 56.19% of their original sizes. [2018-11-18 10:58:56,927 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:58:57,000 INFO L415 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-11-18 10:58:57,000 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:58:57,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:58:57,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-18 10:58:57,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:57,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:58:57,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:58:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:58:57,002 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand 7 states. [2018-11-18 10:58:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:57,734 INFO L93 Difference]: Finished difference Result 728 states and 1090 transitions. [2018-11-18 10:58:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:58:57,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-18 10:58:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:57,737 INFO L225 Difference]: With dead ends: 728 [2018-11-18 10:58:57,737 INFO L226 Difference]: Without dead ends: 615 [2018-11-18 10:58:57,738 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:58:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-18 10:58:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 156. [2018-11-18 10:58:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-18 10:58:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2018-11-18 10:58:57,748 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 46 [2018-11-18 10:58:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:57,749 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2018-11-18 10:58:57,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:58:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2018-11-18 10:58:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 10:58:57,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:57,750 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:58:57,750 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:57,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -512274874, now seen corresponding path program 1 times [2018-11-18 10:58:57,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:57,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:58:57,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:58:57,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:58:57,854 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-18 10:58:57,855 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [33], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:58:57,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:58:57,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:58:57,869 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:58:57,873 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 3. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:58:57,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:57,879 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:58:57,898 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 62.61% of their original sizes. [2018-11-18 10:58:57,898 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:58:57,986 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-18 10:58:57,987 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:58:57,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:58:57,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-18 10:58:57,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:57,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:58:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:58:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:58:57,988 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand 9 states. [2018-11-18 10:58:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:58,953 INFO L93 Difference]: Finished difference Result 857 states and 1282 transitions. [2018-11-18 10:58:58,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:58:58,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-18 10:58:58,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:58,955 INFO L225 Difference]: With dead ends: 857 [2018-11-18 10:58:58,955 INFO L226 Difference]: Without dead ends: 744 [2018-11-18 10:58:58,955 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:58:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-11-18 10:58:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 156. [2018-11-18 10:58:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-18 10:58:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2018-11-18 10:58:58,965 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 47 [2018-11-18 10:58:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:58,965 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2018-11-18 10:58:58,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:58:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2018-11-18 10:58:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 10:58:58,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:58,968 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:58:58,968 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:58,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1541634172, now seen corresponding path program 1 times [2018-11-18 10:58:58,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:58,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:58,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:58,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:58,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:58:59,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:58:59,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:58:59,037 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-18 10:58:59,037 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [11], [19], [22], [33], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:58:59,040 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:58:59,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:58:59,049 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:58:59,050 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 53 root evaluator evaluations with a maximum evaluation depth of 3. Performed 53 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:58:59,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:59,055 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:58:59,073 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 62.61% of their original sizes. [2018-11-18 10:58:59,073 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:58:59,288 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-18 10:58:59,288 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:58:59,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:58:59,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-18 10:58:59,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:59,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:58:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:58:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:58:59,290 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand 8 states. [2018-11-18 10:59:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:00,167 INFO L93 Difference]: Finished difference Result 861 states and 1286 transitions. [2018-11-18 10:59:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:59:00,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-18 10:59:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:00,169 INFO L225 Difference]: With dead ends: 861 [2018-11-18 10:59:00,169 INFO L226 Difference]: Without dead ends: 748 [2018-11-18 10:59:00,170 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:59:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-18 10:59:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 153. [2018-11-18 10:59:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-18 10:59:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2018-11-18 10:59:00,185 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 47 [2018-11-18 10:59:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:00,185 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2018-11-18 10:59:00,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:59:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2018-11-18 10:59:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 10:59:00,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:00,188 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:59:00,188 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:00,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1942844577, now seen corresponding path program 1 times [2018-11-18 10:59:00,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:00,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:00,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:00,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:00,419 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-18 10:59:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:59:00,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:00,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:00,673 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-18 10:59:00,674 INFO L202 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [28], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:00,675 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:00,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:00,681 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:00,681 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 3. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:59:00,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:00,703 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:00,725 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 59.48% of their original sizes. [2018-11-18 10:59:00,726 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:00,791 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-18 10:59:00,792 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:00,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:00,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-18 10:59:00,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:00,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:59:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:59:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:59:00,793 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand 9 states. [2018-11-18 10:59:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:02,541 INFO L93 Difference]: Finished difference Result 845 states and 1264 transitions. [2018-11-18 10:59:02,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:59:02,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-18 10:59:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:02,544 INFO L225 Difference]: With dead ends: 845 [2018-11-18 10:59:02,544 INFO L226 Difference]: Without dead ends: 732 [2018-11-18 10:59:02,544 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:59:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-11-18 10:59:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 157. [2018-11-18 10:59:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 10:59:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 228 transitions. [2018-11-18 10:59:02,557 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 228 transitions. Word has length 47 [2018-11-18 10:59:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:02,557 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 228 transitions. [2018-11-18 10:59:02,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:59:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2018-11-18 10:59:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 10:59:02,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:02,558 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:59:02,558 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:02,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:02,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1508117217, now seen corresponding path program 1 times [2018-11-18 10:59:02,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:02,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:02,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:59:02,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:02,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:02,633 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-18 10:59:02,633 INFO L202 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [30], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:02,634 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:02,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:02,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:02,641 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 53 root evaluator evaluations with a maximum evaluation depth of 3. Performed 53 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:59:02,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:02,651 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:02,660 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 59.48% of their original sizes. [2018-11-18 10:59:02,660 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:02,700 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-18 10:59:02,700 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:02,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:02,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-18 10:59:02,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:02,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:59:02,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:59:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:59:02,701 INFO L87 Difference]: Start difference. First operand 157 states and 228 transitions. Second operand 8 states. [2018-11-18 10:59:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:03,151 INFO L93 Difference]: Finished difference Result 846 states and 1263 transitions. [2018-11-18 10:59:03,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:59:03,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-18 10:59:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:03,153 INFO L225 Difference]: With dead ends: 846 [2018-11-18 10:59:03,153 INFO L226 Difference]: Without dead ends: 733 [2018-11-18 10:59:03,154 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:59:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-18 10:59:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 157. [2018-11-18 10:59:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 10:59:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 228 transitions. [2018-11-18 10:59:03,162 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 228 transitions. Word has length 47 [2018-11-18 10:59:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:03,162 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 228 transitions. [2018-11-18 10:59:03,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:59:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2018-11-18 10:59:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 10:59:03,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:03,163 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:59:03,163 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:03,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:03,163 INFO L82 PathProgramCache]: Analyzing trace with hash 666073406, now seen corresponding path program 1 times [2018-11-18 10:59:03,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:03,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:03,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:59:03,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:03,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:03,226 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-18 10:59:03,226 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [25], [28], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:03,228 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:03,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:03,233 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:03,233 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 61 root evaluator evaluations with a maximum evaluation depth of 3. Performed 61 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:59:03,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:03,239 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:03,246 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 64.97% of their original sizes. [2018-11-18 10:59:03,247 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:03,274 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-18 10:59:03,274 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:03,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:03,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-18 10:59:03,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:03,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:59:03,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:59:03,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:59:03,276 INFO L87 Difference]: Start difference. First operand 157 states and 228 transitions. Second operand 11 states. [2018-11-18 10:59:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:03,863 INFO L93 Difference]: Finished difference Result 966 states and 1446 transitions. [2018-11-18 10:59:03,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:59:03,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-11-18 10:59:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:03,866 INFO L225 Difference]: With dead ends: 966 [2018-11-18 10:59:03,866 INFO L226 Difference]: Without dead ends: 853 [2018-11-18 10:59:03,867 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:59:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-18 10:59:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 161. [2018-11-18 10:59:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-18 10:59:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 235 transitions. [2018-11-18 10:59:03,875 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 235 transitions. Word has length 48 [2018-11-18 10:59:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:03,875 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 235 transitions. [2018-11-18 10:59:03,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:59:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2018-11-18 10:59:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 10:59:03,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:03,876 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:59:03,876 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:03,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash -177932096, now seen corresponding path program 1 times [2018-11-18 10:59:03,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:03,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:59:03,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:03,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:03,927 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-18 10:59:03,927 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [25], [30], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:03,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:03,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:03,934 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:03,935 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 59 root evaluator evaluations with a maximum evaluation depth of 3. Performed 59 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:59:03,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:03,955 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:03,963 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 64.97% of their original sizes. [2018-11-18 10:59:03,963 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:03,995 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-18 10:59:03,995 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:03,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:03,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 10:59:03,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:03,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:59:03,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:59:03,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:59:03,996 INFO L87 Difference]: Start difference. First operand 161 states and 235 transitions. Second operand 10 states. [2018-11-18 10:59:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:04,414 INFO L93 Difference]: Finished difference Result 967 states and 1445 transitions. [2018-11-18 10:59:04,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:59:04,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-18 10:59:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:04,416 INFO L225 Difference]: With dead ends: 967 [2018-11-18 10:59:04,416 INFO L226 Difference]: Without dead ends: 854 [2018-11-18 10:59:04,417 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:59:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-18 10:59:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 157. [2018-11-18 10:59:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 10:59:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 228 transitions. [2018-11-18 10:59:04,424 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 228 transitions. Word has length 48 [2018-11-18 10:59:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:04,425 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 228 transitions. [2018-11-18 10:59:04,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:59:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2018-11-18 10:59:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 10:59:04,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:04,425 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:59:04,426 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:04,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:04,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1179293760, now seen corresponding path program 1 times [2018-11-18 10:59:04,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:04,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:04,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:04,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:04,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:59:04,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:04,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:04,490 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-18 10:59:04,491 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [11], [19], [22], [25], [28], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:04,492 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:04,492 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:04,497 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:04,497 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 59 root evaluator evaluations with a maximum evaluation depth of 3. Performed 59 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:59:04,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:04,498 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:04,505 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 64.97% of their original sizes. [2018-11-18 10:59:04,505 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:04,538 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-18 10:59:04,538 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:04,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:04,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 10:59:04,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:04,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:59:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:59:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:59:04,539 INFO L87 Difference]: Start difference. First operand 157 states and 228 transitions. Second operand 10 states. [2018-11-18 10:59:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:04,869 INFO L93 Difference]: Finished difference Result 958 states and 1436 transitions. [2018-11-18 10:59:04,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:59:04,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-18 10:59:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:04,871 INFO L225 Difference]: With dead ends: 958 [2018-11-18 10:59:04,871 INFO L226 Difference]: Without dead ends: 845 [2018-11-18 10:59:04,872 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:59:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-11-18 10:59:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 157. [2018-11-18 10:59:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 10:59:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 228 transitions. [2018-11-18 10:59:04,882 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 228 transitions. Word has length 48 [2018-11-18 10:59:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:04,882 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 228 transitions. [2018-11-18 10:59:04,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:59:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2018-11-18 10:59:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 10:59:04,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:04,883 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 10:59:04,883 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:04,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:04,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2023299262, now seen corresponding path program 1 times [2018-11-18 10:59:04,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:04,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:04,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:04,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:04,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 10:59:04,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:04,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:04,930 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-18 10:59:04,930 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [11], [19], [22], [25], [30], [38], [42], [46], [145], [149], [151], [154], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:04,931 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:04,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:04,937 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:04,937 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 3. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:59:04,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:04,939 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:04,947 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 64.97% of their original sizes. [2018-11-18 10:59:04,948 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:04,987 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-18 10:59:04,987 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:04,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:04,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-18 10:59:04,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:04,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:59:04,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:59:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:59:04,988 INFO L87 Difference]: Start difference. First operand 157 states and 228 transitions. Second operand 9 states. [2018-11-18 10:59:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:05,267 INFO L93 Difference]: Finished difference Result 959 states and 1435 transitions. [2018-11-18 10:59:05,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:59:05,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-11-18 10:59:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:05,269 INFO L225 Difference]: With dead ends: 959 [2018-11-18 10:59:05,270 INFO L226 Difference]: Without dead ends: 846 [2018-11-18 10:59:05,270 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:59:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-11-18 10:59:05,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 146. [2018-11-18 10:59:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 10:59:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2018-11-18 10:59:05,279 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 48 [2018-11-18 10:59:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:05,279 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2018-11-18 10:59:05,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:59:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2018-11-18 10:59:05,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 10:59:05,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:05,280 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:05,280 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:05,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:05,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1379030073, now seen corresponding path program 1 times [2018-11-18 10:59:05,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:05,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:05,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:05,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:05,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 10:59:05,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:05,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:05,386 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-18 10:59:05,386 INFO L202 CegarAbsIntRunner]: [0], [17], [19], [22], [33], [38], [42], [46], [48], [51], [54], [62], [68], [74], [107], [113], [117], [125], [131], [137], [139], [145], [149], [151], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:05,387 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:05,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:05,392 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:05,392 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 67 root evaluator evaluations with a maximum evaluation depth of 4. Performed 67 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 10:59:05,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:05,394 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:05,405 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 43.66% of their original sizes. [2018-11-18 10:59:05,405 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:05,424 INFO L415 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-11-18 10:59:05,424 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:05,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:05,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-18 10:59:05,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:05,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:59:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:59:05,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:59:05,425 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand 7 states. [2018-11-18 10:59:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:05,659 INFO L93 Difference]: Finished difference Result 596 states and 891 transitions. [2018-11-18 10:59:05,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:59:05,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-18 10:59:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:05,660 INFO L225 Difference]: With dead ends: 596 [2018-11-18 10:59:05,660 INFO L226 Difference]: Without dead ends: 486 [2018-11-18 10:59:05,661 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:59:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-18 10:59:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 146. [2018-11-18 10:59:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 10:59:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2018-11-18 10:59:05,671 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 52 [2018-11-18 10:59:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:05,671 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2018-11-18 10:59:05,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:59:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2018-11-18 10:59:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 10:59:05,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:05,672 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:05,672 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:05,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1300245842, now seen corresponding path program 1 times [2018-11-18 10:59:05,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:05,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:05,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:59:05,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:05,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:59:05,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:05,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:59:05,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:59:05,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:59:05,774 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand 4 states. [2018-11-18 10:59:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:05,955 INFO L93 Difference]: Finished difference Result 375 states and 561 transitions. [2018-11-18 10:59:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:59:05,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-11-18 10:59:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:05,956 INFO L225 Difference]: With dead ends: 375 [2018-11-18 10:59:05,956 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 10:59:05,956 INFO L604 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-11-18 10:59:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 10:59:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 239. [2018-11-18 10:59:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-18 10:59:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 352 transitions. [2018-11-18 10:59:05,970 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 352 transitions. Word has length 52 [2018-11-18 10:59:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:05,970 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 352 transitions. [2018-11-18 10:59:05,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:59:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 352 transitions. [2018-11-18 10:59:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 10:59:05,973 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:05,973 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:05,973 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:05,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash -69418101, now seen corresponding path program 1 times [2018-11-18 10:59:05,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:05,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:05,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:06,143 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-18 10:59:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:59:06,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:06,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:59:06,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:06,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:59:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:59:06,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:59:06,151 INFO L87 Difference]: Start difference. First operand 239 states and 352 transitions. Second operand 4 states. [2018-11-18 10:59:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:06,245 INFO L93 Difference]: Finished difference Result 703 states and 1066 transitions. [2018-11-18 10:59:06,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:59:06,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-11-18 10:59:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:06,246 INFO L225 Difference]: With dead ends: 703 [2018-11-18 10:59:06,246 INFO L226 Difference]: Without dead ends: 489 [2018-11-18 10:59:06,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:59:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-11-18 10:59:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 443. [2018-11-18 10:59:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-18 10:59:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 655 transitions. [2018-11-18 10:59:06,270 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 655 transitions. Word has length 53 [2018-11-18 10:59:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:06,270 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 655 transitions. [2018-11-18 10:59:06,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:59:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 655 transitions. [2018-11-18 10:59:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 10:59:06,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:06,271 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:06,271 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:06,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash 205955779, now seen corresponding path program 1 times [2018-11-18 10:59:06,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:06,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:06,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:06,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:06,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:06,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:06,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:06,315 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-18 10:59:06,315 INFO L202 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [33], [38], [42], [46], [48], [51], [54], [62], [68], [74], [81], [84], [92], [98], [104], [113], [117], [125], [131], [137], [139], [145], [149], [151], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:06,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:06,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:06,337 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:06,337 INFO L272 AbstractInterpreter]: Visited 32 different actions 37 times. Merged at 4 different actions 4 times. Never widened. Performed 127 root evaluator evaluations with a maximum evaluation depth of 4. Performed 127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-18 10:59:06,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:06,357 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:06,380 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 51.29% of their original sizes. [2018-11-18 10:59:06,380 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:06,419 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-18 10:59:06,419 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:06,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:06,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-18 10:59:06,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:06,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:59:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:59:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:59:06,420 INFO L87 Difference]: Start difference. First operand 443 states and 655 transitions. Second operand 9 states. [2018-11-18 10:59:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:07,128 INFO L93 Difference]: Finished difference Result 920 states and 1366 transitions. [2018-11-18 10:59:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:59:07,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-18 10:59:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:07,131 INFO L225 Difference]: With dead ends: 920 [2018-11-18 10:59:07,131 INFO L226 Difference]: Without dead ends: 810 [2018-11-18 10:59:07,132 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:59:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-18 10:59:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 480. [2018-11-18 10:59:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-18 10:59:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 702 transitions. [2018-11-18 10:59:07,162 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 702 transitions. Word has length 57 [2018-11-18 10:59:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:07,162 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 702 transitions. [2018-11-18 10:59:07,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:59:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 702 transitions. [2018-11-18 10:59:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 10:59:07,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:07,163 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:07,164 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:07,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash -68803835, now seen corresponding path program 1 times [2018-11-18 10:59:07,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:07,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:07,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 10:59:07,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:07,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:59:07,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:07,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:59:07,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:59:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:59:07,239 INFO L87 Difference]: Start difference. First operand 480 states and 702 transitions. Second operand 3 states. [2018-11-18 10:59:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:07,280 INFO L93 Difference]: Finished difference Result 641 states and 922 transitions. [2018-11-18 10:59:07,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:59:07,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-11-18 10:59:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:07,282 INFO L225 Difference]: With dead ends: 641 [2018-11-18 10:59:07,282 INFO L226 Difference]: Without dead ends: 606 [2018-11-18 10:59:07,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:59:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-11-18 10:59:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 549. [2018-11-18 10:59:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-11-18 10:59:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 803 transitions. [2018-11-18 10:59:07,315 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 803 transitions. Word has length 57 [2018-11-18 10:59:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:07,315 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 803 transitions. [2018-11-18 10:59:07,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:59:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 803 transitions. [2018-11-18 10:59:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 10:59:07,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:07,316 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:07,316 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:07,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1267005982, now seen corresponding path program 1 times [2018-11-18 10:59:07,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:07,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:07,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:07,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:07,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:07,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-18 10:59:07,408 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [33], [38], [42], [46], [48], [51], [54], [62], [68], [74], [81], [84], [92], [98], [104], [113], [117], [125], [131], [137], [139], [145], [149], [151], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:07,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:07,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:07,420 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:07,420 INFO L272 AbstractInterpreter]: Visited 33 different actions 37 times. Merged at 3 different actions 3 times. Never widened. Performed 124 root evaluator evaluations with a maximum evaluation depth of 4. Performed 124 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-18 10:59:07,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:07,421 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:07,437 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 57.3% of their original sizes. [2018-11-18 10:59:07,438 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:07,550 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-18 10:59:07,550 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:07,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:07,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-18 10:59:07,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:07,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 10:59:07,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:59:07,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:59:07,552 INFO L87 Difference]: Start difference. First operand 549 states and 803 transitions. Second operand 12 states. [2018-11-18 10:59:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:08,679 INFO L93 Difference]: Finished difference Result 1372 states and 2024 transitions. [2018-11-18 10:59:08,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:59:08,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-18 10:59:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:08,682 INFO L225 Difference]: With dead ends: 1372 [2018-11-18 10:59:08,682 INFO L226 Difference]: Without dead ends: 1235 [2018-11-18 10:59:08,683 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:59:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-11-18 10:59:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 585. [2018-11-18 10:59:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-18 10:59:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 848 transitions. [2018-11-18 10:59:08,720 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 848 transitions. Word has length 58 [2018-11-18 10:59:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:08,721 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 848 transitions. [2018-11-18 10:59:08,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 10:59:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 848 transitions. [2018-11-18 10:59:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 10:59:08,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:08,722 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:08,722 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:08,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:08,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1282524700, now seen corresponding path program 1 times [2018-11-18 10:59:08,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:08,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:08,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:08,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:08,810 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-18 10:59:08,810 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [11], [19], [22], [33], [38], [42], [46], [48], [51], [54], [62], [68], [74], [81], [84], [92], [98], [104], [113], [117], [125], [131], [137], [139], [145], [149], [151], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:08,811 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:08,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:08,822 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:08,823 INFO L272 AbstractInterpreter]: Visited 33 different actions 38 times. Merged at 4 different actions 4 times. Never widened. Performed 131 root evaluator evaluations with a maximum evaluation depth of 4. Performed 131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-18 10:59:08,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:08,827 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:08,842 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 57.3% of their original sizes. [2018-11-18 10:59:08,843 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:08,965 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-18 10:59:08,965 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:08,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 10:59:08,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:08,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:59:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:59:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:59:08,966 INFO L87 Difference]: Start difference. First operand 585 states and 848 transitions. Second operand 10 states. [2018-11-18 10:59:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:09,317 INFO L93 Difference]: Finished difference Result 1402 states and 2061 transitions. [2018-11-18 10:59:09,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:59:09,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-18 10:59:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:09,321 INFO L225 Difference]: With dead ends: 1402 [2018-11-18 10:59:09,321 INFO L226 Difference]: Without dead ends: 1265 [2018-11-18 10:59:09,322 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:59:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-11-18 10:59:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 582. [2018-11-18 10:59:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-18 10:59:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 843 transitions. [2018-11-18 10:59:09,366 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 843 transitions. Word has length 58 [2018-11-18 10:59:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:09,366 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 843 transitions. [2018-11-18 10:59:09,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:59:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 843 transitions. [2018-11-18 10:59:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 10:59:09,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:09,368 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:09,368 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:09,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:09,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1415524567, now seen corresponding path program 1 times [2018-11-18 10:59:09,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:09,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:09,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:09,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:09,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:09,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:09,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:09,449 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-18 10:59:09,449 INFO L202 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [28], [38], [42], [46], [48], [51], [54], [62], [68], [74], [81], [84], [92], [98], [104], [113], [117], [125], [131], [137], [139], [145], [149], [151], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:09,452 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:09,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:09,467 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:09,467 INFO L272 AbstractInterpreter]: Visited 33 different actions 38 times. Merged at 4 different actions 4 times. Never widened. Performed 136 root evaluator evaluations with a maximum evaluation depth of 4. Performed 136 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-18 10:59:09,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:09,485 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:09,501 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 56.34% of their original sizes. [2018-11-18 10:59:09,501 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:09,545 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-18 10:59:09,545 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:09,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:09,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-18 10:59:09,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:09,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:59:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:59:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:59:09,546 INFO L87 Difference]: Start difference. First operand 582 states and 843 transitions. Second operand 11 states. [2018-11-18 10:59:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:10,579 INFO L93 Difference]: Finished difference Result 1316 states and 1926 transitions. [2018-11-18 10:59:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:59:10,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 10:59:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:10,581 INFO L225 Difference]: With dead ends: 1316 [2018-11-18 10:59:10,581 INFO L226 Difference]: Without dead ends: 1179 [2018-11-18 10:59:10,582 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:59:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-11-18 10:59:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 616. [2018-11-18 10:59:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-18 10:59:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 887 transitions. [2018-11-18 10:59:10,624 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 887 transitions. Word has length 58 [2018-11-18 10:59:10,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:10,624 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 887 transitions. [2018-11-18 10:59:10,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:59:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 887 transitions. [2018-11-18 10:59:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 10:59:10,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:10,626 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:10,626 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:10,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash 512748135, now seen corresponding path program 1 times [2018-11-18 10:59:10,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:10,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:10,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:10,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:10,697 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-18 10:59:10,697 INFO L202 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [30], [38], [42], [46], [48], [51], [54], [62], [68], [74], [81], [84], [92], [98], [104], [113], [117], [125], [131], [137], [139], [145], [149], [151], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:10,698 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:10,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:10,708 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:59:10,708 INFO L272 AbstractInterpreter]: Visited 33 different actions 38 times. Merged at 4 different actions 4 times. Never widened. Performed 131 root evaluator evaluations with a maximum evaluation depth of 4. Performed 131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-18 10:59:10,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:10,710 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:59:10,725 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 56.34% of their original sizes. [2018-11-18 10:59:10,725 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:59:10,841 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-18 10:59:10,841 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:59:10,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:10,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-18 10:59:10,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:10,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:59:10,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:59:10,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:59:10,842 INFO L87 Difference]: Start difference. First operand 616 states and 887 transitions. Second operand 10 states. [2018-11-18 10:59:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:11,396 INFO L93 Difference]: Finished difference Result 1340 states and 1958 transitions. [2018-11-18 10:59:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:59:11,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-18 10:59:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:11,398 INFO L225 Difference]: With dead ends: 1340 [2018-11-18 10:59:11,398 INFO L226 Difference]: Without dead ends: 1203 [2018-11-18 10:59:11,399 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:59:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-11-18 10:59:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 616. [2018-11-18 10:59:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-18 10:59:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 887 transitions. [2018-11-18 10:59:11,423 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 887 transitions. Word has length 58 [2018-11-18 10:59:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:11,423 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 887 transitions. [2018-11-18 10:59:11,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:59:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 887 transitions. [2018-11-18 10:59:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 10:59:11,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:11,425 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 10:59:11,425 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:11,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash 167301098, now seen corresponding path program 1 times [2018-11-18 10:59:11,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:11,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:11,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:11,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:11,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:59:11,474 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-18 10:59:11,474 INFO L202 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [25], [28], [38], [42], [46], [48], [51], [54], [62], [68], [74], [81], [84], [92], [98], [104], [113], [117], [125], [131], [137], [139], [145], [149], [151], [156], [160], [162], [166], [168], [174], [176], [180], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-11-18 10:59:11,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:59:11,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:59:11,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:59:11,499 INFO L272 AbstractInterpreter]: Visited 52 different actions 91 times. Merged at 11 different actions 29 times. Never widened. Performed 264 root evaluator evaluations with a maximum evaluation depth of 6. Performed 264 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 6 different actions. Largest state had 23 variables. [2018-11-18 10:59:11,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:11,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:59:11,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:11,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:59:11,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:11,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:59:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:11,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:59:11,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:59:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:59:11,703 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:59:11,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2018-11-18 10:59:11,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:59:11,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:59:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:59:11,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:59:11,704 INFO L87 Difference]: Start difference. First operand 616 states and 887 transitions. Second operand 4 states. [2018-11-18 10:59:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:11,866 INFO L93 Difference]: Finished difference Result 1336 states and 2011 transitions. [2018-11-18 10:59:11,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:59:11,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-18 10:59:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:11,868 INFO L225 Difference]: With dead ends: 1336 [2018-11-18 10:59:11,868 INFO L226 Difference]: Without dead ends: 814 [2018-11-18 10:59:11,869 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:59:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-11-18 10:59:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 723. [2018-11-18 10:59:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-11-18 10:59:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 980 transitions. [2018-11-18 10:59:11,899 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 980 transitions. Word has length 59 [2018-11-18 10:59:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:11,900 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 980 transitions. [2018-11-18 10:59:11,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:59:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 980 transitions. [2018-11-18 10:59:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 10:59:11,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:11,901 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:11,901 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:11,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1760043162, now seen corresponding path program 1 times [2018-11-18 10:59:11,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:59:11,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:11,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:11,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:11,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:59:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:11,933 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 10:59:11,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:59:11 BoogieIcfgContainer [2018-11-18 10:59:11,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:59:11,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:59:11,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:59:11,976 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:59:11,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:58:54" (3/4) ... [2018-11-18 10:59:11,978 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:59:11,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:59:11,979 INFO L168 Benchmark]: Toolchain (without parser) took 18597.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:11,980 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:59:11,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.61 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:11,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.36 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:59:11,981 INFO L168 Benchmark]: Boogie Preprocessor took 86.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 946.4 MB in the beginning and 1.2 GB in the end (delta: -214.2 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:11,981 INFO L168 Benchmark]: RCFGBuilder took 419.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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-11-18 10:59:11,981 INFO L168 Benchmark]: TraceAbstraction took 17820.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.5 MB). Peak memory consumption was 146.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:11,982 INFO L168 Benchmark]: Witness Printer took 4.67 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:59:11,983 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.61 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 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 21.36 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 946.4 MB in the beginning and 1.2 GB in the end (delta: -214.2 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 419.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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 17820.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.5 MB). Peak memory consumption was 146.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.67 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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] RET 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] 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, 56 locations, 1 error locations. UNSAFE Result, 17.7s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4263 SDtfs, 6128 SDslu, 13474 SDs, 0 SdLazy, 4631 SolverSat, 360 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 30 DeclaredPredicates, 926 GetRequests, 777 SyntacticMatches, 7 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=723occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 16 AbstIntIterations, 15 AbstIntStrong, 0.9865237673083417 AbsIntWeakeningRatio, 0.7460106382978723 AbsIntAvgWeakeningVarsNumRemoved, 0.976063829787234 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 9258 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1313 NumberOfCodeBlocks, 1313 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1279 ConstructedInterpolants, 2 QuantifiedInterpolants, 182589 SizeOfPredicates, 2 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 389/466 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-5842f4b [2018-11-18 10:59:13,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:59:13,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:59:13,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:59:13,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:59:13,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:59:13,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:59:13,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:59:13,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:59:13,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:59:13,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:59:13,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:59:13,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:59:13,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:59:13,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:59:13,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:59:13,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:59:13,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:59:13,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:59:13,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:59:13,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:59:13,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:59:13,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:59:13,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:59:13,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:59:13,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:59:13,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:59:13,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:59:13,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:59:13,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:59:13,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:59:13,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:59:13,634 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:59:13,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:59:13,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:59:13,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:59:13,637 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 10:59:13,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:59:13,648 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:59:13,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:59:13,649 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:59:13,649 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:59:13,649 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:59:13,649 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:59:13,649 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:59:13,650 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:59:13,650 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:59:13,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:59:13,652 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:59:13,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:59:13,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:59:13,652 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:59:13,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:59:13,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:59:13,653 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 10:59:13,653 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 10:59:13,653 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:59:13,653 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:59:13,653 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:59:13,653 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:59:13,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:59:13,654 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:59:13,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:59:13,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:59:13,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:59:13,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:59:13,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:59:13,656 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:59:13,656 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 10:59:13,656 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:59:13,657 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 10:59:13,657 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 10:59:13,657 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_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan 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 -> Taipan 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-11-18 10:59:13,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:59:13,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:59:13,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:59:13,703 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:59:13,703 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:59:13,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 10:59:13,746 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data/faa9a03a6/fe0411c83e0442889b298a74ef3f53eb/FLAG5efe40552 [2018-11-18 10:59:14,095 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:59:14,095 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 10:59:14,101 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data/faa9a03a6/fe0411c83e0442889b298a74ef3f53eb/FLAG5efe40552 [2018-11-18 10:59:14,521 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/data/faa9a03a6/fe0411c83e0442889b298a74ef3f53eb [2018-11-18 10:59:14,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:59:14,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:59:14,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:59:14,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:59:14,529 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:59:14,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bd33a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14, skipping insertion in model container [2018-11-18 10:59:14,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:59:14,560 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:59:14,717 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:59:14,720 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:59:14,759 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:59:14,778 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:59:14,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14 WrapperNode [2018-11-18 10:59:14,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:59:14,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:59:14,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:59:14,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:59:14,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:59:14,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:59:14,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:59:14,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:59:14,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... [2018-11-18 10:59:14,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:59:14,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:59:14,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:59:14,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:59:14,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:59:14,922 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-18 10:59:14,922 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-18 10:59:14,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:59:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:59:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:59:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:59:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:59:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:59:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 10:59:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 10:59:15,215 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:59:15,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:15 BoogieIcfgContainer [2018-11-18 10:59:15,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:59:15,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:59:15,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:59:15,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:59:15,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:59:14" (1/3) ... [2018-11-18 10:59:15,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a031f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:59:15, skipping insertion in model container [2018-11-18 10:59:15,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:14" (2/3) ... [2018-11-18 10:59:15,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a031f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:59:15, skipping insertion in model container [2018-11-18 10:59:15,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:15" (3/3) ... [2018-11-18 10:59:15,222 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-18 10:59:15,228 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:59:15,233 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:59:15,242 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:59:15,261 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:59:15,261 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:59:15,262 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:59:15,262 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:59:15,262 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:59:15,262 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:59:15,262 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:59:15,262 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:59:15,262 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:59:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-18 10:59:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:59:15,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:15,279 INFO L375 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-11-18 10:59:15,280 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:15,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash -486194587, now seen corresponding path program 1 times [2018-11-18 10:59:15,287 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:15,287 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:15,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:15,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:15,352 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:15,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:15,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:59:15,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 10:59:15,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 10:59:15,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 10:59:15,372 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-18 10:59:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:15,392 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-11-18 10:59:15,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 10:59:15,393 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-18 10:59:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:15,401 INFO L225 Difference]: With dead ends: 79 [2018-11-18 10:59:15,401 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 10:59:15,403 INFO L604 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-11-18 10:59:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 10:59:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-18 10:59:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 10:59:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-11-18 10:59:15,435 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 21 [2018-11-18 10:59:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:15,436 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-18 10:59:15,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 10:59:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-11-18 10:59:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:59:15,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:15,437 INFO L375 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-11-18 10:59:15,437 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:15,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1212978296, now seen corresponding path program 1 times [2018-11-18 10:59:15,438 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:15,438 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:15,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:15,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:15,539 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:15,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:15,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:59:15,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:59:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:59:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:59:15,542 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 4 states. [2018-11-18 10:59:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:15,989 INFO L93 Difference]: Finished difference Result 138 states and 227 transitions. [2018-11-18 10:59:15,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:59:15,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-18 10:59:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:15,992 INFO L225 Difference]: With dead ends: 138 [2018-11-18 10:59:15,992 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 10:59:15,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-11-18 10:59:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 10:59:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-11-18 10:59:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 10:59:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2018-11-18 10:59:16,005 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 23 [2018-11-18 10:59:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:16,006 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2018-11-18 10:59:16,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:59:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2018-11-18 10:59:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:59:16,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:16,008 INFO L375 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] [2018-11-18 10:59:16,008 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:16,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:16,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1536350606, now seen corresponding path program 1 times [2018-11-18 10:59:16,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:16,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:16,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:16,083 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:16,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:16,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:59:16,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:59:16,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:59:16,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:59:16,088 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 5 states. [2018-11-18 10:59:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:16,363 INFO L93 Difference]: Finished difference Result 191 states and 306 transitions. [2018-11-18 10:59:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:59:16,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-18 10:59:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:16,365 INFO L225 Difference]: With dead ends: 191 [2018-11-18 10:59:16,365 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 10:59:16,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-11-18 10:59:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 10:59:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2018-11-18 10:59:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 10:59:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2018-11-18 10:59:16,375 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 24 [2018-11-18 10:59:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:16,375 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2018-11-18 10:59:16,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:59:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2018-11-18 10:59:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:59:16,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:16,376 INFO L375 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] [2018-11-18 10:59:16,377 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:16,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash -888363149, now seen corresponding path program 1 times [2018-11-18 10:59:16,377 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:16,377 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:16,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:16,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:16,441 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:16,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:16,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:59:16,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:59:16,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:59:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:59:16,444 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 7 states. [2018-11-18 10:59:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:16,590 INFO L93 Difference]: Finished difference Result 240 states and 377 transitions. [2018-11-18 10:59:16,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:59:16,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 10:59:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:16,592 INFO L225 Difference]: With dead ends: 240 [2018-11-18 10:59:16,593 INFO L226 Difference]: Without dead ends: 206 [2018-11-18 10:59:16,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-11-18 10:59:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-18 10:59:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2018-11-18 10:59:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 10:59:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 204 transitions. [2018-11-18 10:59:16,609 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 204 transitions. Word has length 25 [2018-11-18 10:59:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:16,610 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 204 transitions. [2018-11-18 10:59:16,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:59:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 204 transitions. [2018-11-18 10:59:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:59:16,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:16,612 INFO L375 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] [2018-11-18 10:59:16,612 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:16,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:16,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1909431503, now seen corresponding path program 1 times [2018-11-18 10:59:16,613 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:16,613 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:16,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:16,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:16,698 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:16,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:16,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:59:16,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:59:16,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:59:16,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:59:16,700 INFO L87 Difference]: Start difference. First operand 135 states and 204 transitions. Second operand 6 states. [2018-11-18 10:59:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:16,901 INFO L93 Difference]: Finished difference Result 260 states and 399 transitions. [2018-11-18 10:59:16,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:59:16,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-18 10:59:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:16,903 INFO L225 Difference]: With dead ends: 260 [2018-11-18 10:59:16,903 INFO L226 Difference]: Without dead ends: 226 [2018-11-18 10:59:16,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-11-18 10:59:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-18 10:59:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 105. [2018-11-18 10:59:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 10:59:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2018-11-18 10:59:16,913 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 25 [2018-11-18 10:59:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:16,914 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2018-11-18 10:59:16,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:59:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2018-11-18 10:59:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 10:59:16,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:16,915 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 10:59:16,915 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:16,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash 90534596, now seen corresponding path program 1 times [2018-11-18 10:59:16,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:16,916 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:16,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:16,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:16,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:16,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:16,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:59:16,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:59:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:59:16,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:59:16,968 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand 4 states. [2018-11-18 10:59:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:17,057 INFO L93 Difference]: Finished difference Result 268 states and 386 transitions. [2018-11-18 10:59:17,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:59:17,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-18 10:59:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:17,058 INFO L225 Difference]: With dead ends: 268 [2018-11-18 10:59:17,059 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 10:59:17,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-11-18 10:59:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 10:59:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2018-11-18 10:59:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 10:59:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 248 transitions. [2018-11-18 10:59:17,070 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 248 transitions. Word has length 37 [2018-11-18 10:59:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:17,070 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 248 transitions. [2018-11-18 10:59:17,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:59:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 248 transitions. [2018-11-18 10:59:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 10:59:17,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:17,073 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 10:59:17,073 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:17,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash 431468861, now seen corresponding path program 1 times [2018-11-18 10:59:17,074 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:17,074 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:17,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:17,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:17,155 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:17,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:17,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:59:17,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:59:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:59:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:59:17,158 INFO L87 Difference]: Start difference. First operand 173 states and 248 transitions. Second operand 5 states. [2018-11-18 10:59:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:17,293 INFO L93 Difference]: Finished difference Result 349 states and 502 transitions. [2018-11-18 10:59:17,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:59:17,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-18 10:59:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:17,294 INFO L225 Difference]: With dead ends: 349 [2018-11-18 10:59:17,294 INFO L226 Difference]: Without dead ends: 271 [2018-11-18 10:59:17,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-11-18 10:59:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-18 10:59:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 173. [2018-11-18 10:59:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 10:59:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 248 transitions. [2018-11-18 10:59:17,304 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 248 transitions. Word has length 38 [2018-11-18 10:59:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:17,304 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 248 transitions. [2018-11-18 10:59:17,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:59:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 248 transitions. [2018-11-18 10:59:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 10:59:17,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:17,306 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 10:59:17,306 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:17,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash -747145201, now seen corresponding path program 1 times [2018-11-18 10:59:17,308 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:17,308 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:17,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:17,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:17,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:17,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:17,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:59:17,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:59:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:59:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:59:17,407 INFO L87 Difference]: Start difference. First operand 173 states and 248 transitions. Second operand 7 states. [2018-11-18 10:59:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:17,521 INFO L93 Difference]: Finished difference Result 424 states and 606 transitions. [2018-11-18 10:59:17,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:59:17,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-18 10:59:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:17,523 INFO L225 Difference]: With dead ends: 424 [2018-11-18 10:59:17,523 INFO L226 Difference]: Without dead ends: 346 [2018-11-18 10:59:17,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-11-18 10:59:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-18 10:59:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 233. [2018-11-18 10:59:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-18 10:59:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 330 transitions. [2018-11-18 10:59:17,537 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 330 transitions. Word has length 39 [2018-11-18 10:59:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:17,537 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 330 transitions. [2018-11-18 10:59:17,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:59:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 330 transitions. [2018-11-18 10:59:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 10:59:17,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:17,538 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 10:59:17,539 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:17,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1256618291, now seen corresponding path program 1 times [2018-11-18 10:59:17,539 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:17,539 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:17,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:17,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:17,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:17,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:59:17,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:59:17,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:59:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:59:17,607 INFO L87 Difference]: Start difference. First operand 233 states and 330 transitions. Second operand 6 states. [2018-11-18 10:59:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:17,687 INFO L93 Difference]: Finished difference Result 422 states and 600 transitions. [2018-11-18 10:59:17,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:59:17,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-18 10:59:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:17,688 INFO L225 Difference]: With dead ends: 422 [2018-11-18 10:59:17,688 INFO L226 Difference]: Without dead ends: 344 [2018-11-18 10:59:17,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-18 10:59:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-18 10:59:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 165. [2018-11-18 10:59:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-18 10:59:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 230 transitions. [2018-11-18 10:59:17,698 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 230 transitions. Word has length 39 [2018-11-18 10:59:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:17,698 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 230 transitions. [2018-11-18 10:59:17,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:59:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 230 transitions. [2018-11-18 10:59:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 10:59:17,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:17,700 INFO L375 BasicCegarLoop]: trace histogram [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-11-18 10:59:17,700 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:17,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:17,700 INFO L82 PathProgramCache]: Analyzing trace with hash -459438472, now seen corresponding path program 1 times [2018-11-18 10:59:17,700 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:17,700 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:17,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:17,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:17,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:59:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:17,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:17,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:59:17,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:17,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:17,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:59:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:17,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 10:59:17,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4, 4] total 12 [2018-11-18 10:59:17,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 10:59:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:59:17,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:59:17,873 INFO L87 Difference]: Start difference. First operand 165 states and 230 transitions. Second operand 12 states. [2018-11-18 10:59:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:18,712 INFO L93 Difference]: Finished difference Result 968 states and 1529 transitions. [2018-11-18 10:59:18,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 10:59:18,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-18 10:59:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:18,714 INFO L225 Difference]: With dead ends: 968 [2018-11-18 10:59:18,715 INFO L226 Difference]: Without dead ends: 833 [2018-11-18 10:59:18,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2018-11-18 10:59:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2018-11-18 10:59:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 652. [2018-11-18 10:59:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-18 10:59:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 962 transitions. [2018-11-18 10:59:18,749 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 962 transitions. Word has length 41 [2018-11-18 10:59:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:18,749 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 962 transitions. [2018-11-18 10:59:18,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 10:59:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 962 transitions. [2018-11-18 10:59:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 10:59:18,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:18,752 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:18,753 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:18,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash 487113925, now seen corresponding path program 1 times [2018-11-18 10:59:18,753 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:18,753 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:18,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:18,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 10:59:18,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:59:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 10:59:18,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:18,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:59:18,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:18,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 10:59:19,006 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 10:59:19,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:59:19,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2018-11-18 10:59:19,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:59:19,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:59:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:59:19,031 INFO L87 Difference]: Start difference. First operand 652 states and 962 transitions. Second operand 9 states. [2018-11-18 10:59:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:19,597 INFO L93 Difference]: Finished difference Result 1813 states and 2721 transitions. [2018-11-18 10:59:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:59:19,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-18 10:59:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:59:19,602 INFO L225 Difference]: With dead ends: 1813 [2018-11-18 10:59:19,602 INFO L226 Difference]: Without dead ends: 1469 [2018-11-18 10:59:19,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:59:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-11-18 10:59:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1268. [2018-11-18 10:59:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-11-18 10:59:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1839 transitions. [2018-11-18 10:59:19,642 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1839 transitions. Word has length 64 [2018-11-18 10:59:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:59:19,643 INFO L480 AbstractCegarLoop]: Abstraction has 1268 states and 1839 transitions. [2018-11-18 10:59:19,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:59:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1839 transitions. [2018-11-18 10:59:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 10:59:19,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:59:19,644 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:19,645 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:59:19,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1760043162, now seen corresponding path program 1 times [2018-11-18 10:59:19,645 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 10:59:19,645 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 10:59:19,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:19,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:20,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:59:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:22,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:59:22,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:59:22,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:22,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:23,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:59:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:59:24,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 10:59:24,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23] total 50 [2018-11-18 10:59:24,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-18 10:59:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-18 10:59:24,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2237, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 10:59:24,195 INFO L87 Difference]: Start difference. First operand 1268 states and 1839 transitions. Second operand 50 states. [2018-11-18 10:59:40,084 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2018-11-18 10:59:42,681 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-11-18 10:59:47,739 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-11-18 10:59:52,282 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-11-18 10:59:55,994 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2018-11-18 10:59:56,701 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-11-18 10:59:57,999 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2018-11-18 10:59:58,953 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2018-11-18 10:59:59,613 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-18 11:00:09,160 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-11-18 11:00:10,697 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-18 11:00:11,020 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-11-18 11:00:11,616 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-11-18 11:00:11,987 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-11-18 11:00:12,787 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-11-18 11:00:13,285 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-11-18 11:00:13,685 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2018-11-18 11:00:14,150 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-11-18 11:00:15,309 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2018-11-18 11:00:15,820 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-18 11:00:16,771 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-11-18 11:00:17,165 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-11-18 11:00:20,199 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-11-18 11:00:20,858 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-11-18 11:00:22,497 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2018-11-18 11:00:22,807 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-18 11:00:23,556 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2018-11-18 11:00:24,225 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-18 11:00:25,085 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-11-18 11:00:25,414 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-11-18 11:00:26,015 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-18 11:00:26,387 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-11-18 11:00:27,735 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-11-18 11:00:28,550 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2018-11-18 11:00:29,672 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-11-18 11:00:29,997 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-11-18 11:00:30,344 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2018-11-18 11:00:31,098 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2018-11-18 11:00:31,764 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-18 11:00:33,617 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-11-18 11:00:34,523 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2018-11-18 11:00:35,293 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-11-18 11:00:37,597 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-11-18 11:00:38,328 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-11-18 11:00:39,318 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-11-18 11:00:41,571 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-11-18 11:00:42,064 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2018-11-18 11:00:45,444 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-11-18 11:00:46,106 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-11-18 11:00:46,470 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-18 11:00:46,896 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-11-18 11:00:47,677 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-11-18 11:00:48,834 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-11-18 11:00:49,847 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 115 [2018-11-18 11:00:50,774 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2018-11-18 11:00:51,424 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-18 11:00:52,447 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2018-11-18 11:00:53,018 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-18 11:00:53,806 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-18 11:00:54,824 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-11-18 11:00:55,767 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2018-11-18 11:00:56,565 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2018-11-18 11:00:58,839 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-18 11:00:59,795 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-11-18 11:01:01,258 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2018-11-18 11:01:01,713 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2018-11-18 11:01:02,561 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 118 [2018-11-18 11:01:03,229 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-11-18 11:01:04,668 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-18 11:01:05,099 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-11-18 11:01:05,775 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-11-18 11:01:06,546 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-11-18 11:01:07,436 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-11-18 11:01:08,464 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-11-18 11:01:09,197 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-11-18 11:01:11,673 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2018-11-18 11:01:14,012 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2018-11-18 11:01:14,884 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 121 [2018-11-18 11:01:15,673 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2018-11-18 11:01:16,249 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2018-11-18 11:01:17,300 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2018-11-18 11:01:18,988 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2018-11-18 11:01:20,046 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2018-11-18 11:01:20,474 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-18 11:01:21,938 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-11-18 11:01:23,145 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-11-18 11:01:23,769 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-11-18 11:01:24,556 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 111 [2018-11-18 11:01:25,577 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-11-18 11:01:26,519 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-18 11:01:28,301 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2018-11-18 11:01:29,042 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2018-11-18 11:01:29,949 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-11-18 11:01:31,122 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-18 11:01:31,843 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-18 11:01:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:01:31,869 INFO L93 Difference]: Finished difference Result 11174 states and 16316 transitions. [2018-11-18 11:01:31,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2018-11-18 11:01:31,869 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-11-18 11:01:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:01:31,896 INFO L225 Difference]: With dead ends: 11174 [2018-11-18 11:01:31,897 INFO L226 Difference]: Without dead ends: 10795 [2018-11-18 11:01:31,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45878 ImplicationChecksByTransitivity, 113.9s TimeCoverageRelationStatistics Valid=22983, Invalid=99867, Unknown=0, NotChecked=0, Total=122850 [2018-11-18 11:01:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2018-11-18 11:01:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 3757. [2018-11-18 11:01:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2018-11-18 11:01:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 5667 transitions. [2018-11-18 11:01:32,161 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 5667 transitions. Word has length 66 [2018-11-18 11:01:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:01:32,162 INFO L480 AbstractCegarLoop]: Abstraction has 3757 states and 5667 transitions. [2018-11-18 11:01:32,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-18 11:01:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 5667 transitions. [2018-11-18 11:01:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 11:01:32,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:01:32,164 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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-11-18 11:01:32,164 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:01:32,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:01:32,165 INFO L82 PathProgramCache]: Analyzing trace with hash 942394712, now seen corresponding path program 1 times [2018-11-18 11:01:32,165 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:01:32,165 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:01:32,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:01:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:01:32,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:01:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:01:32,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:01:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:01:32,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:01:32,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:01:32,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:01:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:01:32,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:01:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:01:32,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:01:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 11:01:32,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 11:01:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 4] total 10 [2018-11-18 11:01:32,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:01:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:01:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:01:32,480 INFO L87 Difference]: Start difference. First operand 3757 states and 5667 transitions. Second operand 10 states. [2018-11-18 11:01:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:01:33,327 INFO L93 Difference]: Finished difference Result 9158 states and 14002 transitions. [2018-11-18 11:01:33,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 11:01:33,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-18 11:01:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:01:33,338 INFO L225 Difference]: With dead ends: 9158 [2018-11-18 11:01:33,338 INFO L226 Difference]: Without dead ends: 5449 [2018-11-18 11:01:33,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 267 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2018-11-18 11:01:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2018-11-18 11:01:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 4587. [2018-11-18 11:01:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4587 states. [2018-11-18 11:01:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 6433 transitions. [2018-11-18 11:01:33,530 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 6433 transitions. Word has length 66 [2018-11-18 11:01:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:01:33,530 INFO L480 AbstractCegarLoop]: Abstraction has 4587 states and 6433 transitions. [2018-11-18 11:01:33,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:01:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 6433 transitions. [2018-11-18 11:01:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 11:01:33,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:01:33,533 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:01:33,533 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:01:33,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:01:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash -689556968, now seen corresponding path program 1 times [2018-11-18 11:01:33,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:01:33,533 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:01:33,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:01:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:01:33,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:01:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 11:01:33,597 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:01:33,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:01:33,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:01:33,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:01:33,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:01:33,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:01:33,598 INFO L87 Difference]: Start difference. First operand 4587 states and 6433 transitions. Second operand 3 states. [2018-11-18 11:01:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:01:33,752 INFO L93 Difference]: Finished difference Result 5574 states and 7623 transitions. [2018-11-18 11:01:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:01:33,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 11:01:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:01:33,759 INFO L225 Difference]: With dead ends: 5574 [2018-11-18 11:01:33,759 INFO L226 Difference]: Without dead ends: 5469 [2018-11-18 11:01:33,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-11-18 11:01:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2018-11-18 11:01:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 4982. [2018-11-18 11:01:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4982 states. [2018-11-18 11:01:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 6892 transitions. [2018-11-18 11:01:33,919 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 6892 transitions. Word has length 66 [2018-11-18 11:01:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:01:33,919 INFO L480 AbstractCegarLoop]: Abstraction has 4982 states and 6892 transitions. [2018-11-18 11:01:33,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:01:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 6892 transitions. [2018-11-18 11:01:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 11:01:33,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:01:33,921 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:01:33,921 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:01:33,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:01:33,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2091023460, now seen corresponding path program 1 times [2018-11-18 11:01:33,921 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:01:33,921 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:01:33,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:01:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:01:33,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:01:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 11:01:33,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:01:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 11:01:34,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:01:34,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:01:34,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:01:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:01:34,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:01:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 11:01:34,090 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:01:34,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:01:34,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2018-11-18 11:01:34,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:01:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:01:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:01:34,107 INFO L87 Difference]: Start difference. First operand 4982 states and 6892 transitions. Second operand 14 states. [2018-11-18 11:01:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:01:35,211 INFO L93 Difference]: Finished difference Result 11501 states and 16017 transitions. [2018-11-18 11:01:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 11:01:35,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-11-18 11:01:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:01:35,221 INFO L225 Difference]: With dead ends: 11501 [2018-11-18 11:01:35,221 INFO L226 Difference]: Without dead ends: 6342 [2018-11-18 11:01:35,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2018-11-18 11:01:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6342 states. [2018-11-18 11:01:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6342 to 3707. [2018-11-18 11:01:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2018-11-18 11:01:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4592 transitions. [2018-11-18 11:01:35,381 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4592 transitions. Word has length 66 [2018-11-18 11:01:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:01:35,381 INFO L480 AbstractCegarLoop]: Abstraction has 3707 states and 4592 transitions. [2018-11-18 11:01:35,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:01:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4592 transitions. [2018-11-18 11:01:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:01:35,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:01:35,382 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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-11-18 11:01:35,382 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:01:35,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:01:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1119117464, now seen corresponding path program 1 times [2018-11-18 11:01:35,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:01:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:01:35,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:01:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:01:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:01:35,501 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 11:01:35,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:01:35 BoogieIcfgContainer [2018-11-18 11:01:35,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:01:35,544 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:01:35,544 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:01:35,544 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:01:35,544 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:15" (3/4) ... [2018-11-18 11:01:35,546 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 11:01:35,628 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_abd2f388-948a-4709-990e-37cb5f12f790/bin-2019/utaipan/witness.graphml [2018-11-18 11:01:35,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:01:35,629 INFO L168 Benchmark]: Toolchain (without parser) took 141105.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 951.9 MB in the beginning and 826.7 MB in the end (delta: 125.2 MB). Peak memory consumption was 425.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:01:35,629 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:01:35,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:01:35,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.86 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:01:35,630 INFO L168 Benchmark]: Boogie Preprocessor took 34.43 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:01:35,630 INFO L168 Benchmark]: RCFGBuilder took 383.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:01:35,632 INFO L168 Benchmark]: TraceAbstraction took 140327.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 837.4 MB in the end (delta: 251.6 MB). Peak memory consumption was 432.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:01:35,632 INFO L168 Benchmark]: Witness Printer took 84.34 ms. Allocated memory is still 1.3 GB. Free memory was 837.4 MB in the beginning and 826.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:01:35,634 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 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 18.86 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.43 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 383.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 140327.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 837.4 MB in the end (delta: 251.6 MB). Peak memory consumption was 432.5 MB. Max. memory is 11.5 GB. * Witness Printer took 84.34 ms. Allocated memory is still 1.3 GB. Free memory was 837.4 MB in the beginning and 826.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. 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)=149, \old(b)=106] [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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L70] COND TRUE i < nb VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=149] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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)=149, \old(b)=106, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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] RET return r; VAL [\old(a)=149, \old(b)=106, \result=511, a=149, a0=-107, a1=0, a2=0, a3=0, b=106, b0=106, 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] EXPR mp_add(a, b) VAL [a=149, b=106, 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, 56 locations, 1 error locations. UNSAFE Result, 140.2s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 132.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1943 SDtfs, 7688 SDslu, 10649 SDs, 0 SdLazy, 16810 SolverSat, 1500 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1775 GetRequests, 1295 SyntacticMatches, 9 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46416 ImplicationChecksByTransitivity, 115.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4982occurred in iteration=14, 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.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 12066 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1012 NumberOfCodeBlocks, 1012 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 825944 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1617 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 355/451 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...