./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-1dbac8b [2018-10-26 20:21:10,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:21:10,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:21:10,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:21:10,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:21:10,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:21:10,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:21:10,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:21:10,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:21:10,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:21:10,024 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:21:10,024 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:21:10,024 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:21:10,025 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:21:10,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:21:10,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:21:10,035 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:21:10,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:21:10,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:21:10,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:21:10,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:21:10,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:21:10,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:21:10,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:21:10,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:21:10,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:21:10,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:21:10,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:21:10,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:21:10,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:21:10,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:21:10,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:21:10,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:21:10,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:21:10,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:21:10,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:21:10,056 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:21:10,072 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:21:10,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:21:10,075 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:21:10,075 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:21:10,075 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:21:10,076 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:21:10,076 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:21:10,076 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:21:10,077 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:21:10,077 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:21:10,077 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:21:10,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:21:10,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:21:10,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:21:10,079 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:21:10,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:21:10,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:21:10,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:21:10,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:21:10,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:21:10,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:21:10,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:21:10,080 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:21:10,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:21:10,080 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:21:10,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:21:10,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:21:10,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:21:10,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:21:10,081 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:21:10,081 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:21:10,081 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:21:10,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:21:10,082 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:21:10,082 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_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:21:10,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:21:10,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:21:10,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:21:10,127 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:21:10,127 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:21:10,128 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-10-26 20:21:10,171 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data/048cce545/33e2c5f56c0b4f5db0070421b0c97956/FLAG1ec4afb90 [2018-10-26 20:21:10,559 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:21:10,559 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-10-26 20:21:10,565 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data/048cce545/33e2c5f56c0b4f5db0070421b0c97956/FLAG1ec4afb90 [2018-10-26 20:21:10,575 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data/048cce545/33e2c5f56c0b4f5db0070421b0c97956 [2018-10-26 20:21:10,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:21:10,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:21:10,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:21:10,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:21:10,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:21:10,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b8fdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10, skipping insertion in model container [2018-10-26 20:21:10,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:21:10,616 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:21:10,751 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:21:10,754 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:21:10,783 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:21:10,794 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:21:10,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10 WrapperNode [2018-10-26 20:21:10,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:21:10,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:21:10,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:21:10,795 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:21:10,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:21:10,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:21:10,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:21:10,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:21:10,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... [2018-10-26 20:21:10,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:21:10,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:21:10,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:21:10,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:21:10,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:21:10,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:21:10,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:21:10,961 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-10-26 20:21:10,961 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-10-26 20:21:10,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:21:10,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:21:10,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:21:10,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:21:10,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 20:21:10,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 20:21:11,527 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:21:11,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:21:11 BoogieIcfgContainer [2018-10-26 20:21:11,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:21:11,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:21:11,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:21:11,531 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:21:11,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:21:10" (1/3) ... [2018-10-26 20:21:11,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23415ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:21:11, skipping insertion in model container [2018-10-26 20:21:11,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:21:10" (2/3) ... [2018-10-26 20:21:11,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23415ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:21:11, skipping insertion in model container [2018-10-26 20:21:11,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:21:11" (3/3) ... [2018-10-26 20:21:11,534 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-10-26 20:21:11,543 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:21:11,550 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:21:11,564 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:21:11,608 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:21:11,608 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:21:11,609 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:21:11,609 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:21:11,609 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:21:11,609 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:21:11,609 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:21:11,609 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:21:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-10-26 20:21:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:21:11,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:11,645 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-10-26 20:21:11,648 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:11,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:11,655 INFO L82 PathProgramCache]: Analyzing trace with hash 572437916, now seen corresponding path program 1 times [2018-10-26 20:21:11,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:11,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:11,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:11,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:11,701 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:11,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:21:11,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:21:11,795 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:11,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 20:21:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 20:21:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:21:11,814 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-10-26 20:21:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:11,835 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-10-26 20:21:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 20:21:11,836 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-26 20:21:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:11,845 INFO L225 Difference]: With dead ends: 79 [2018-10-26 20:21:11,845 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 20:21:11,848 INFO L605 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-10-26 20:21:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 20:21:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-26 20:21:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 20:21:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-10-26 20:21:11,880 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 21 [2018-10-26 20:21:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:11,880 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-10-26 20:21:11,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 20:21:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-10-26 20:21:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:21:11,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:11,881 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-10-26 20:21:11,882 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:11,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash 855921951, now seen corresponding path program 1 times [2018-10-26 20:21:11,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:11,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:11,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:11,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:11,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:12,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:21:12,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:21:12,020 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:12,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:21:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:21:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:21:12,022 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 3 states. [2018-10-26 20:21:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:12,389 INFO L93 Difference]: Finished difference Result 108 states and 175 transitions. [2018-10-26 20:21:12,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:21:12,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:21:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:12,391 INFO L225 Difference]: With dead ends: 108 [2018-10-26 20:21:12,391 INFO L226 Difference]: Without dead ends: 74 [2018-10-26 20:21:12,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:21:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-26 20:21:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-26 20:21:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-26 20:21:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-10-26 20:21:12,401 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 23 [2018-10-26 20:21:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:12,401 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-10-26 20:21:12,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:21:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2018-10-26 20:21:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:21:12,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:12,402 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-10-26 20:21:12,403 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:12,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:12,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1752800542, now seen corresponding path program 1 times [2018-10-26 20:21:12,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:12,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:21:12,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:21:12,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:21:12,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:12,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:21:12,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:21:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:21:12,515 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 4 states. [2018-10-26 20:21:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:13,080 INFO L93 Difference]: Finished difference Result 149 states and 236 transitions. [2018-10-26 20:21:13,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:21:13,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-10-26 20:21:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:13,081 INFO L225 Difference]: With dead ends: 149 [2018-10-26 20:21:13,081 INFO L226 Difference]: Without dead ends: 115 [2018-10-26 20:21:13,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:21:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-26 20:21:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-10-26 20:21:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-26 20:21:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2018-10-26 20:21:13,092 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 30 [2018-10-26 20:21:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:13,092 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2018-10-26 20:21:13,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:21:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2018-10-26 20:21:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 20:21:13,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:13,094 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-10-26 20:21:13,095 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:13,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:13,095 INFO L82 PathProgramCache]: Analyzing trace with hash -57924349, now seen corresponding path program 1 times [2018-10-26 20:21:13,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:13,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:13,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:13,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:13,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:13,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:21:13,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:21:13,195 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:13,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:21:13,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:21:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:21:13,196 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand 4 states. [2018-10-26 20:21:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:13,494 INFO L93 Difference]: Finished difference Result 235 states and 346 transitions. [2018-10-26 20:21:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:21:13,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-26 20:21:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:13,496 INFO L225 Difference]: With dead ends: 235 [2018-10-26 20:21:13,496 INFO L226 Difference]: Without dead ends: 160 [2018-10-26 20:21:13,497 INFO L605 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-10-26 20:21:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-26 20:21:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2018-10-26 20:21:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-26 20:21:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2018-10-26 20:21:13,508 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 37 [2018-10-26 20:21:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:13,509 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2018-10-26 20:21:13,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:21:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2018-10-26 20:21:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 20:21:13,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:13,511 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-10-26 20:21:13,511 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:13,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:13,512 INFO L82 PathProgramCache]: Analyzing trace with hash -962301442, now seen corresponding path program 1 times [2018-10-26 20:21:13,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:13,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:13,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:13,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:13,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 20:21:13,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:21:13,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:21:13,585 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:13,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:21:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:21:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:21:13,586 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand 5 states. [2018-10-26 20:21:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:13,891 INFO L93 Difference]: Finished difference Result 372 states and 520 transitions. [2018-10-26 20:21:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:21:13,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-26 20:21:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:13,895 INFO L225 Difference]: With dead ends: 372 [2018-10-26 20:21:13,895 INFO L226 Difference]: Without dead ends: 259 [2018-10-26 20:21:13,896 INFO L605 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-10-26 20:21:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-26 20:21:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 140. [2018-10-26 20:21:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-26 20:21:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 195 transitions. [2018-10-26 20:21:13,911 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 195 transitions. Word has length 44 [2018-10-26 20:21:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:13,911 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 195 transitions. [2018-10-26 20:21:13,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:21:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 195 transitions. [2018-10-26 20:21:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:21:13,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:13,913 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-10-26 20:21:13,913 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:13,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:13,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1999480767, now seen corresponding path program 1 times [2018-10-26 20:21:13,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:13,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:13,916 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 20:21:13,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:21:13,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:21:13,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:13,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:21:13,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:21:13,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:21:13,994 INFO L87 Difference]: Start difference. First operand 140 states and 195 transitions. Second operand 5 states. [2018-10-26 20:21:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:14,334 INFO L93 Difference]: Finished difference Result 380 states and 528 transitions. [2018-10-26 20:21:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:21:14,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-10-26 20:21:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:14,336 INFO L225 Difference]: With dead ends: 380 [2018-10-26 20:21:14,336 INFO L226 Difference]: Without dead ends: 267 [2018-10-26 20:21:14,337 INFO L605 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-10-26 20:21:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-26 20:21:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 153. [2018-10-26 20:21:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-26 20:21:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2018-10-26 20:21:14,349 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 45 [2018-10-26 20:21:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:14,350 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2018-10-26 20:21:14,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:21:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2018-10-26 20:21:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 20:21:14,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:14,352 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-10-26 20:21:14,352 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:14,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash -379562385, now seen corresponding path program 1 times [2018-10-26 20:21:14,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:14,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:14,355 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:14,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:14,551 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:14,551 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-26 20:21:14,552 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [15], [20], [23], [34], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:14,596 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:14,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:14,727 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:14,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:14,760 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:14,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:14,774 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:14,871 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 81.26% of their original sizes. [2018-10-26 20:21:14,871 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:15,008 INFO L415 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-10-26 20:21:15,009 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:15,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:15,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-10-26 20:21:15,010 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:15,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:21:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:21:15,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:21:15,011 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand 7 states. [2018-10-26 20:21:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:18,517 INFO L93 Difference]: Finished difference Result 728 states and 1018 transitions. [2018-10-26 20:21:18,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:21:18,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-10-26 20:21:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:18,519 INFO L225 Difference]: With dead ends: 728 [2018-10-26 20:21:18,519 INFO L226 Difference]: Without dead ends: 615 [2018-10-26 20:21:18,520 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:21:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-10-26 20:21:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 156. [2018-10-26 20:21:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-26 20:21:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2018-10-26 20:21:18,533 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 46 [2018-10-26 20:21:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:18,533 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2018-10-26 20:21:18,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:21:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2018-10-26 20:21:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 20:21:18,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:18,534 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-10-26 20:21:18,535 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:18,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1491700643, now seen corresponding path program 1 times [2018-10-26 20:21:18,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:18,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:18,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:18,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:18,967 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:18,967 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-10-26 20:21:18,968 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [20], [23], [34], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:18,970 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:18,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:18,981 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:18,990 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:18,990 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:19,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:19,026 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:19,061 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 83.17% of their original sizes. [2018-10-26 20:21:19,061 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:19,139 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-10-26 20:21:19,139 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:19,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:19,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-26 20:21:19,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:19,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:21:19,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:21:19,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:19,140 INFO L87 Difference]: Start difference. First operand 156 states and 214 transitions. Second operand 9 states. [2018-10-26 20:21:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:21,558 INFO L93 Difference]: Finished difference Result 857 states and 1198 transitions. [2018-10-26 20:21:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:21:21,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-10-26 20:21:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:21,561 INFO L225 Difference]: With dead ends: 857 [2018-10-26 20:21:21,561 INFO L226 Difference]: Without dead ends: 744 [2018-10-26 20:21:21,562 INFO L605 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-10-26 20:21:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-26 20:21:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 156. [2018-10-26 20:21:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-26 20:21:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2018-10-26 20:21:21,577 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 47 [2018-10-26 20:21:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:21,578 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2018-10-26 20:21:21,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:21:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2018-10-26 20:21:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 20:21:21,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:21,579 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-10-26 20:21:21,581 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:21,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1773907355, now seen corresponding path program 1 times [2018-10-26 20:21:21,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:21,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:21,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:21,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:21,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:21,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:21,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:21,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-10-26 20:21:21,652 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [12], [20], [23], [34], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:21,653 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:21,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:21,662 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:21,669 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:21,669 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:21,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:21,678 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:21,719 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 83.17% of their original sizes. [2018-10-26 20:21:21,719 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:21,857 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-10-26 20:21:21,858 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:21,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:21,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-10-26 20:21:21,858 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:21,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:21:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:21:21,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:21:21,859 INFO L87 Difference]: Start difference. First operand 156 states and 214 transitions. Second operand 8 states. [2018-10-26 20:21:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:24,390 INFO L93 Difference]: Finished difference Result 861 states and 1202 transitions. [2018-10-26 20:21:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:21:24,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-10-26 20:21:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:24,393 INFO L225 Difference]: With dead ends: 861 [2018-10-26 20:21:24,393 INFO L226 Difference]: Without dead ends: 748 [2018-10-26 20:21:24,395 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:21:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-26 20:21:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 153. [2018-10-26 20:21:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-26 20:21:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2018-10-26 20:21:24,407 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 47 [2018-10-26 20:21:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:24,407 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2018-10-26 20:21:24,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:21:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2018-10-26 20:21:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 20:21:24,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:24,409 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-10-26 20:21:24,409 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:24,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1372696950, now seen corresponding path program 1 times [2018-10-26 20:21:24,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:24,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:24,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:24,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:24,413 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:24,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:24,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:24,609 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-10-26 20:21:24,609 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [15], [20], [23], [26], [29], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:24,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:24,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:24,618 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:24,622 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:24,622 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:24,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:24,623 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:24,649 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 82.06% of their original sizes. [2018-10-26 20:21:24,649 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:24,813 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-10-26 20:21:24,813 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:24,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:24,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-26 20:21:24,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:24,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:21:24,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:21:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:24,815 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand 9 states. [2018-10-26 20:21:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:26,530 INFO L93 Difference]: Finished difference Result 845 states and 1180 transitions. [2018-10-26 20:21:26,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:21:26,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-10-26 20:21:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:26,532 INFO L225 Difference]: With dead ends: 845 [2018-10-26 20:21:26,532 INFO L226 Difference]: Without dead ends: 732 [2018-10-26 20:21:26,533 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-10-26 20:21:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 157. [2018-10-26 20:21:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-26 20:21:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2018-10-26 20:21:26,547 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 47 [2018-10-26 20:21:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:26,551 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2018-10-26 20:21:26,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:21:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2018-10-26 20:21:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 20:21:26,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:26,552 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-10-26 20:21:26,552 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:26,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 528691448, now seen corresponding path program 1 times [2018-10-26 20:21:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:26,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:26,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:26,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:26,677 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:26,677 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-10-26 20:21:26,678 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [15], [20], [23], [26], [31], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:26,679 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:26,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:26,687 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:26,692 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:26,692 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:26,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:26,693 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:26,722 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 82.06% of their original sizes. [2018-10-26 20:21:26,722 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:26,798 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-10-26 20:21:26,798 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:26,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:26,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-10-26 20:21:26,799 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:26,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:21:26,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:21:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:21:26,799 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand 8 states. [2018-10-26 20:21:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:27,957 INFO L93 Difference]: Finished difference Result 846 states and 1179 transitions. [2018-10-26 20:21:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:21:27,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-10-26 20:21:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:27,959 INFO L225 Difference]: With dead ends: 846 [2018-10-26 20:21:27,959 INFO L226 Difference]: Without dead ends: 733 [2018-10-26 20:21:27,960 INFO L605 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-10-26 20:21:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-10-26 20:21:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 157. [2018-10-26 20:21:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-26 20:21:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2018-10-26 20:21:27,973 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 47 [2018-10-26 20:21:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:27,973 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2018-10-26 20:21:27,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:21:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2018-10-26 20:21:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 20:21:27,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:27,974 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-10-26 20:21:27,974 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:27,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1256149320, now seen corresponding path program 1 times [2018-10-26 20:21:27,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:27,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:27,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:27,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:27,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:28,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:28,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:28,118 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-26 20:21:28,118 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [20], [23], [26], [29], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:28,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:28,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:28,127 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:28,134 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:28,134 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:28,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:28,158 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:28,184 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.76% of their original sizes. [2018-10-26 20:21:28,184 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:28,262 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-10-26 20:21:28,262 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:28,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:28,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-10-26 20:21:28,262 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:28,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:21:28,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:21:28,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:21:28,263 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand 11 states. [2018-10-26 20:21:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:31,834 INFO L93 Difference]: Finished difference Result 966 states and 1350 transitions. [2018-10-26 20:21:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:21:31,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-10-26 20:21:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:31,836 INFO L225 Difference]: With dead ends: 966 [2018-10-26 20:21:31,836 INFO L226 Difference]: Without dead ends: 853 [2018-10-26 20:21:31,836 INFO L605 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-10-26 20:21:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-10-26 20:21:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 161. [2018-10-26 20:21:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-26 20:21:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2018-10-26 20:21:31,849 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 48 [2018-10-26 20:21:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:31,850 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2018-10-26 20:21:31,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 20:21:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2018-10-26 20:21:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 20:21:31,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:31,850 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-10-26 20:21:31,851 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:31,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash 412143818, now seen corresponding path program 1 times [2018-10-26 20:21:31,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:31,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:31,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:31,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:31,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:31,973 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:31,973 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-26 20:21:31,973 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [20], [23], [26], [31], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:31,974 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:31,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:31,981 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:31,986 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:31,986 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:31,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:31,991 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:32,013 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.76% of their original sizes. [2018-10-26 20:21:32,013 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:32,918 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-10-26 20:21:32,919 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:32,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:32,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-26 20:21:32,919 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:32,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:21:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:21:32,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:21:32,920 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand 10 states. [2018-10-26 20:21:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:34,508 INFO L93 Difference]: Finished difference Result 967 states and 1349 transitions. [2018-10-26 20:21:34,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:21:34,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-10-26 20:21:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:34,510 INFO L225 Difference]: With dead ends: 967 [2018-10-26 20:21:34,510 INFO L226 Difference]: Without dead ends: 854 [2018-10-26 20:21:34,511 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:21:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-10-26 20:21:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 157. [2018-10-26 20:21:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-26 20:21:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2018-10-26 20:21:34,525 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 48 [2018-10-26 20:21:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:34,526 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2018-10-26 20:21:34,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:21:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2018-10-26 20:21:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 20:21:34,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:34,527 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-10-26 20:21:34,527 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:34,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:34,528 INFO L82 PathProgramCache]: Analyzing trace with hash -589217846, now seen corresponding path program 1 times [2018-10-26 20:21:34,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:34,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:34,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:34,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:34,529 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:34,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:34,577 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:34,577 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-26 20:21:34,577 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [12], [20], [23], [26], [29], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:34,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:34,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:34,584 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:34,589 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:34,589 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:34,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:34,630 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:34,652 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.76% of their original sizes. [2018-10-26 20:21:34,652 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:34,701 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-10-26 20:21:34,701 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:34,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:34,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-26 20:21:34,701 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:34,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:21:34,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:21:34,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:21:34,702 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand 10 states. [2018-10-26 20:21:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:35,756 INFO L93 Difference]: Finished difference Result 958 states and 1340 transitions. [2018-10-26 20:21:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:21:35,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-10-26 20:21:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:35,758 INFO L225 Difference]: With dead ends: 958 [2018-10-26 20:21:35,758 INFO L226 Difference]: Without dead ends: 845 [2018-10-26 20:21:35,759 INFO L605 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-10-26 20:21:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-10-26 20:21:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 157. [2018-10-26 20:21:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-26 20:21:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2018-10-26 20:21:35,775 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 48 [2018-10-26 20:21:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:35,775 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2018-10-26 20:21:35,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:21:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2018-10-26 20:21:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 20:21:35,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:35,776 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-10-26 20:21:35,776 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:35,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1433223348, now seen corresponding path program 1 times [2018-10-26 20:21:35,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:35,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:35,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:35,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:35,777 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:21:35,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:35,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:35,886 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-26 20:21:35,886 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [12], [20], [23], [26], [31], [39], [43], [47], [146], [150], [152], [155], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:35,887 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:35,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:35,896 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:35,901 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:35,901 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:35,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:35,903 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:35,932 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.76% of their original sizes. [2018-10-26 20:21:35,932 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:36,244 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-10-26 20:21:36,244 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:36,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:36,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-26 20:21:36,245 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:36,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:21:36,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:21:36,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:36,245 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand 9 states. [2018-10-26 20:21:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:36,940 INFO L93 Difference]: Finished difference Result 959 states and 1339 transitions. [2018-10-26 20:21:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:21:36,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-26 20:21:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:36,942 INFO L225 Difference]: With dead ends: 959 [2018-10-26 20:21:36,942 INFO L226 Difference]: Without dead ends: 846 [2018-10-26 20:21:36,943 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-10-26 20:21:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 146. [2018-10-26 20:21:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-26 20:21:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2018-10-26 20:21:36,961 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 48 [2018-10-26 20:21:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:36,961 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2018-10-26 20:21:36,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:21:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2018-10-26 20:21:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 20:21:36,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:36,962 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-10-26 20:21:36,962 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:36,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:36,962 INFO L82 PathProgramCache]: Analyzing trace with hash -516694075, now seen corresponding path program 1 times [2018-10-26 20:21:36,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:36,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:36,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:36,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:36,963 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:21:37,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:21:37,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:21:37,053 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:37,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:21:37,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:21:37,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:21:37,054 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 3 states. [2018-10-26 20:21:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:37,133 INFO L93 Difference]: Finished difference Result 206 states and 277 transitions. [2018-10-26 20:21:37,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:21:37,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-26 20:21:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:37,136 INFO L225 Difference]: With dead ends: 206 [2018-10-26 20:21:37,136 INFO L226 Difference]: Without dead ends: 173 [2018-10-26 20:21:37,136 INFO L605 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-10-26 20:21:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-26 20:21:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-26 20:21:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-26 20:21:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2018-10-26 20:21:37,151 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 52 [2018-10-26 20:21:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:37,151 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2018-10-26 20:21:37,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:21:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2018-10-26 20:21:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 20:21:37,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:37,152 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-10-26 20:21:37,152 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:37,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash -241934461, now seen corresponding path program 1 times [2018-10-26 20:21:37,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:37,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:37,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:37,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:37,261 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:37,261 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-10-26 20:21:37,261 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [23], [34], [39], [43], [47], [49], [52], [55], [63], [69], [75], [108], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:37,262 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:37,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:37,269 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:37,279 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:37,279 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:37,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:37,300 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:37,348 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 71.7% of their original sizes. [2018-10-26 20:21:37,349 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:37,474 INFO L415 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-10-26 20:21:37,474 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:37,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:37,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-10-26 20:21:37,474 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:37,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:21:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:21:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:21:37,475 INFO L87 Difference]: Start difference. First operand 173 states and 235 transitions. Second operand 8 states. [2018-10-26 20:21:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:40,202 INFO L93 Difference]: Finished difference Result 731 states and 1006 transitions. [2018-10-26 20:21:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:21:40,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-10-26 20:21:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:40,204 INFO L225 Difference]: With dead ends: 731 [2018-10-26 20:21:40,204 INFO L226 Difference]: Without dead ends: 594 [2018-10-26 20:21:40,205 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:21:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-10-26 20:21:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 173. [2018-10-26 20:21:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-26 20:21:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2018-10-26 20:21:40,226 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 52 [2018-10-26 20:21:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:40,227 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2018-10-26 20:21:40,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:21:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2018-10-26 20:21:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 20:21:40,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:40,228 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-10-26 20:21:40,228 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:40,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash -320718692, now seen corresponding path program 1 times [2018-10-26 20:21:40,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:40,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:40,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:40,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:40,234 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:40,619 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 20:21:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:40,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:40,719 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:40,719 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-10-26 20:21:40,719 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [15], [20], [37], [39], [43], [47], [49], [78], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:40,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:40,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:40,733 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:40,740 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:40,740 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:40,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:40,782 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:40,812 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 76.51% of their original sizes. [2018-10-26 20:21:40,812 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:41,187 INFO L415 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-10-26 20:21:41,187 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:41,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:41,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-10-26 20:21:41,188 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:41,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:21:41,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:21:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:21:41,188 INFO L87 Difference]: Start difference. First operand 173 states and 235 transitions. Second operand 7 states. [2018-10-26 20:21:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:41,995 INFO L93 Difference]: Finished difference Result 745 states and 1023 transitions. [2018-10-26 20:21:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:21:41,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-10-26 20:21:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:41,996 INFO L225 Difference]: With dead ends: 745 [2018-10-26 20:21:41,997 INFO L226 Difference]: Without dead ends: 607 [2018-10-26 20:21:41,997 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:21:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-26 20:21:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 175. [2018-10-26 20:21:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-26 20:21:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 238 transitions. [2018-10-26 20:21:42,015 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 238 transitions. Word has length 52 [2018-10-26 20:21:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:42,015 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 238 transitions. [2018-10-26 20:21:42,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:21:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 238 transitions. [2018-10-26 20:21:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 20:21:42,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:42,016 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-10-26 20:21:42,016 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:42,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2107792578, now seen corresponding path program 1 times [2018-10-26 20:21:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:42,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:42,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:42,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:42,109 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:42,109 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-26 20:21:42,109 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [23], [26], [29], [39], [43], [47], [49], [52], [55], [63], [69], [75], [108], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:42,112 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:42,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:42,116 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:42,122 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:42,123 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:42,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:42,124 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:42,155 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 73.87% of their original sizes. [2018-10-26 20:21:42,156 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:42,321 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-10-26 20:21:42,321 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:42,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:42,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-26 20:21:42,321 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:42,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:21:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:21:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:21:42,322 INFO L87 Difference]: Start difference. First operand 175 states and 238 transitions. Second operand 10 states. [2018-10-26 20:21:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:42,890 INFO L93 Difference]: Finished difference Result 873 states and 1202 transitions. [2018-10-26 20:21:42,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:21:42,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-10-26 20:21:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:42,892 INFO L225 Difference]: With dead ends: 873 [2018-10-26 20:21:42,892 INFO L226 Difference]: Without dead ends: 736 [2018-10-26 20:21:42,893 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:21:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-10-26 20:21:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 175. [2018-10-26 20:21:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-26 20:21:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 238 transitions. [2018-10-26 20:21:42,920 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 238 transitions. Word has length 53 [2018-10-26 20:21:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:42,921 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 238 transitions. [2018-10-26 20:21:42,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:21:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 238 transitions. [2018-10-26 20:21:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 20:21:42,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:42,925 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-10-26 20:21:42,925 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:42,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1939028224, now seen corresponding path program 1 times [2018-10-26 20:21:42,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:42,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:42,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:42,927 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:43,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:43,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:43,169 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-26 20:21:43,169 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [23], [26], [31], [39], [43], [47], [49], [52], [55], [63], [69], [75], [108], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:43,170 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:43,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:43,179 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:43,189 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:43,189 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:43,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:43,196 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:43,230 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 73.87% of their original sizes. [2018-10-26 20:21:43,230 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:43,389 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-10-26 20:21:43,389 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:43,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:43,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-26 20:21:43,389 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:43,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:21:43,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:21:43,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:43,390 INFO L87 Difference]: Start difference. First operand 175 states and 238 transitions. Second operand 9 states. [2018-10-26 20:21:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:44,169 INFO L93 Difference]: Finished difference Result 877 states and 1206 transitions. [2018-10-26 20:21:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:21:44,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-10-26 20:21:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:44,171 INFO L225 Difference]: With dead ends: 877 [2018-10-26 20:21:44,171 INFO L226 Difference]: Without dead ends: 740 [2018-10-26 20:21:44,172 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-10-26 20:21:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 166. [2018-10-26 20:21:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-26 20:21:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2018-10-26 20:21:44,194 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 53 [2018-10-26 20:21:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:44,194 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2018-10-26 20:21:44,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:21:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2018-10-26 20:21:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 20:21:44,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:44,195 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-10-26 20:21:44,195 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:44,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1289333770, now seen corresponding path program 1 times [2018-10-26 20:21:44,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:44,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:44,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:44,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:44,314 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:44,315 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-26 20:21:44,315 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [20], [37], [39], [43], [47], [49], [78], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:44,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:44,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:44,323 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:44,329 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:44,329 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:44,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:44,331 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:44,350 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 79.06% of their original sizes. [2018-10-26 20:21:44,351 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:44,393 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-10-26 20:21:44,393 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:44,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:44,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-26 20:21:44,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:44,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:21:44,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:21:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:44,394 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand 9 states. [2018-10-26 20:21:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:45,187 INFO L93 Difference]: Finished difference Result 884 states and 1218 transitions. [2018-10-26 20:21:45,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:21:45,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-10-26 20:21:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:45,189 INFO L225 Difference]: With dead ends: 884 [2018-10-26 20:21:45,189 INFO L226 Difference]: Without dead ends: 746 [2018-10-26 20:21:45,189 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 45 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-10-26 20:21:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-10-26 20:21:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 166. [2018-10-26 20:21:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-26 20:21:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2018-10-26 20:21:45,209 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 53 [2018-10-26 20:21:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:45,210 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2018-10-26 20:21:45,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:21:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2018-10-26 20:21:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 20:21:45,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:45,211 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-10-26 20:21:45,212 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:45,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:45,212 INFO L82 PathProgramCache]: Analyzing trace with hash -760054072, now seen corresponding path program 1 times [2018-10-26 20:21:45,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:45,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:45,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:45,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:45,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:45,555 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 20:21:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:45,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:45,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:45,563 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-26 20:21:45,563 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [12], [20], [37], [39], [43], [47], [49], [78], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:45,565 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:45,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:45,572 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:45,577 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:45,577 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-10-26 20:21:45,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:45,579 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:45,597 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 79.06% of their original sizes. [2018-10-26 20:21:45,597 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:45,632 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-10-26 20:21:45,632 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:45,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:45,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-10-26 20:21:45,633 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:45,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:21:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:21:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:21:45,634 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand 8 states. [2018-10-26 20:21:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:46,406 INFO L93 Difference]: Finished difference Result 880 states and 1213 transitions. [2018-10-26 20:21:46,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:21:46,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-10-26 20:21:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:46,408 INFO L225 Difference]: With dead ends: 880 [2018-10-26 20:21:46,408 INFO L226 Difference]: Without dead ends: 742 [2018-10-26 20:21:46,409 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:21:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-10-26 20:21:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 160. [2018-10-26 20:21:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-26 20:21:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 218 transitions. [2018-10-26 20:21:46,435 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 218 transitions. Word has length 53 [2018-10-26 20:21:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:46,435 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 218 transitions. [2018-10-26 20:21:46,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:21:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2018-10-26 20:21:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 20:21:46,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:46,436 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] [2018-10-26 20:21:46,436 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:46,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1327729205, now seen corresponding path program 1 times [2018-10-26 20:21:46,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:46,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:46,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:46,834 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 20:21:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:46,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:46,930 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:46,931 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-26 20:21:46,931 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [37], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:46,932 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:46,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:46,941 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:46,970 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:46,970 INFO L272 AbstractInterpreter]: Visited 30 different actions 35 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:21:47,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:47,014 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:47,076 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 68.6% of their original sizes. [2018-10-26 20:21:47,077 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:47,825 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-10-26 20:21:47,825 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:47,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:47,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-26 20:21:47,826 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:47,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:21:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:21:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:21:47,826 INFO L87 Difference]: Start difference. First operand 160 states and 218 transitions. Second operand 9 states. [2018-10-26 20:21:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:49,044 INFO L93 Difference]: Finished difference Result 609 states and 833 transitions. [2018-10-26 20:21:49,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:21:49,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-10-26 20:21:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:49,046 INFO L225 Difference]: With dead ends: 609 [2018-10-26 20:21:49,046 INFO L226 Difference]: Without dead ends: 472 [2018-10-26 20:21:49,046 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:21:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-26 20:21:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 189. [2018-10-26 20:21:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-26 20:21:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 249 transitions. [2018-10-26 20:21:49,070 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 249 transitions. Word has length 55 [2018-10-26 20:21:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:49,071 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 249 transitions. [2018-10-26 20:21:49,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:21:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 249 transitions. [2018-10-26 20:21:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 20:21:49,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:49,072 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] [2018-10-26 20:21:49,072 INFO L424 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:49,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1390119177, now seen corresponding path program 1 times [2018-10-26 20:21:49,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:49,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:49,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:49,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:49,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:49,686 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-10-26 20:21:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:49,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:49,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:49,879 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-26 20:21:49,879 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [23], [34], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:49,881 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:49,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:49,893 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:49,917 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:49,918 INFO L272 AbstractInterpreter]: Visited 31 different actions 36 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:21:49,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:49,958 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:50,024 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 71.03% of their original sizes. [2018-10-26 20:21:50,025 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:50,944 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-10-26 20:21:50,945 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:50,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:50,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-10-26 20:21:50,945 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:50,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:21:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:21:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:21:50,946 INFO L87 Difference]: Start difference. First operand 189 states and 249 transitions. Second operand 10 states. [2018-10-26 20:21:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:52,149 INFO L93 Difference]: Finished difference Result 767 states and 1045 transitions. [2018-10-26 20:21:52,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:21:52,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-10-26 20:21:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:52,150 INFO L225 Difference]: With dead ends: 767 [2018-10-26 20:21:52,150 INFO L226 Difference]: Without dead ends: 630 [2018-10-26 20:21:52,151 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:21:52,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-26 20:21:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 190. [2018-10-26 20:21:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-26 20:21:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 251 transitions. [2018-10-26 20:21:52,176 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 251 transitions. Word has length 56 [2018-10-26 20:21:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:52,176 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 251 transitions. [2018-10-26 20:21:52,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:21:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 251 transitions. [2018-10-26 20:21:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 20:21:52,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:52,177 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] [2018-10-26 20:21:52,177 INFO L424 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:52,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1587615656, now seen corresponding path program 1 times [2018-10-26 20:21:52,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:52,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:52,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:52,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:52,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:52,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:52,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:52,329 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-26 20:21:52,329 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [15], [20], [37], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:52,331 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:52,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:52,337 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:52,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:52,362 INFO L272 AbstractInterpreter]: Visited 31 different actions 36 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:21:52,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:52,410 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:52,453 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 71.47% of their original sizes. [2018-10-26 20:21:52,453 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:52,540 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-10-26 20:21:52,540 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:52,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:52,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-10-26 20:21:52,541 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:52,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:21:52,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:21:52,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:21:52,541 INFO L87 Difference]: Start difference. First operand 190 states and 251 transitions. Second operand 10 states. [2018-10-26 20:21:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:53,457 INFO L93 Difference]: Finished difference Result 780 states and 1061 transitions. [2018-10-26 20:21:53,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:21:53,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-10-26 20:21:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:53,459 INFO L225 Difference]: With dead ends: 780 [2018-10-26 20:21:53,459 INFO L226 Difference]: Without dead ends: 643 [2018-10-26 20:21:53,460 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:21:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-10-26 20:21:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 192. [2018-10-26 20:21:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-26 20:21:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 254 transitions. [2018-10-26 20:21:53,476 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 254 transitions. Word has length 56 [2018-10-26 20:21:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:53,476 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 254 transitions. [2018-10-26 20:21:53,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:21:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 254 transitions. [2018-10-26 20:21:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 20:21:53,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:53,477 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-10-26 20:21:53,477 INFO L424 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:53,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:53,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1533263030, now seen corresponding path program 1 times [2018-10-26 20:21:53,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:53,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:53,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:53,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:53,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:53,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:53,544 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:53,544 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 20:21:53,545 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [23], [26], [29], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:53,545 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:53,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:53,550 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:53,573 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:53,573 INFO L272 AbstractInterpreter]: Visited 32 different actions 37 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:21:53,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:53,582 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:53,650 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.09% of their original sizes. [2018-10-26 20:21:53,650 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:53,831 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 20:21:53,831 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:53,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:53,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-26 20:21:53,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:53,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:21:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:21:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:21:53,832 INFO L87 Difference]: Start difference. First operand 192 states and 254 transitions. Second operand 12 states. [2018-10-26 20:21:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:55,231 INFO L93 Difference]: Finished difference Result 951 states and 1285 transitions. [2018-10-26 20:21:55,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 20:21:55,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-10-26 20:21:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:55,234 INFO L225 Difference]: With dead ends: 951 [2018-10-26 20:21:55,234 INFO L226 Difference]: Without dead ends: 813 [2018-10-26 20:21:55,235 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-10-26 20:21:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-26 20:21:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 220. [2018-10-26 20:21:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-26 20:21:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 284 transitions. [2018-10-26 20:21:55,258 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 284 transitions. Word has length 57 [2018-10-26 20:21:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:55,258 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 284 transitions. [2018-10-26 20:21:55,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:21:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 284 transitions. [2018-10-26 20:21:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 20:21:55,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:55,259 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-10-26 20:21:55,259 INFO L424 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:55,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:55,259 INFO L82 PathProgramCache]: Analyzing trace with hash -833431564, now seen corresponding path program 1 times [2018-10-26 20:21:55,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:55,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:55,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:55,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:55,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:56,030 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-10-26 20:21:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:56,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:56,223 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:56,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 20:21:56,224 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [23], [26], [31], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:56,225 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:56,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:56,234 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:56,265 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:56,265 INFO L272 AbstractInterpreter]: Visited 32 different actions 37 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:21:56,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:56,282 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:56,334 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.09% of their original sizes. [2018-10-26 20:21:56,335 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:56,487 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 20:21:56,487 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:56,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-10-26 20:21:56,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:56,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:21:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:21:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:21:56,488 INFO L87 Difference]: Start difference. First operand 220 states and 284 transitions. Second operand 11 states. [2018-10-26 20:21:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:57,815 INFO L93 Difference]: Finished difference Result 972 states and 1307 transitions. [2018-10-26 20:21:57,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 20:21:57,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-10-26 20:21:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:57,817 INFO L225 Difference]: With dead ends: 972 [2018-10-26 20:21:57,817 INFO L226 Difference]: Without dead ends: 835 [2018-10-26 20:21:57,818 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:21:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-10-26 20:21:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 220. [2018-10-26 20:21:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-26 20:21:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 284 transitions. [2018-10-26 20:21:57,847 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 284 transitions. Word has length 57 [2018-10-26 20:21:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:57,847 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 284 transitions. [2018-10-26 20:21:57,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 20:21:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 284 transitions. [2018-10-26 20:21:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 20:21:57,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:57,848 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-10-26 20:21:57,848 INFO L424 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:57,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1169499158, now seen corresponding path program 1 times [2018-10-26 20:21:57,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:57,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:57,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:57,854 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:57,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:57,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:57,933 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 20:21:57,933 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [20], [37], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:57,934 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:57,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:57,938 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:57,951 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:57,951 INFO L272 AbstractInterpreter]: Visited 32 different actions 36 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:21:57,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:57,952 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:57,993 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.82% of their original sizes. [2018-10-26 20:21:57,993 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:58,126 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 20:21:58,126 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:58,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:58,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-10-26 20:21:58,127 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:58,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 20:21:58,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 20:21:58,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-26 20:21:58,127 INFO L87 Difference]: Start difference. First operand 220 states and 284 transitions. Second operand 13 states. [2018-10-26 20:21:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:21:59,134 INFO L93 Difference]: Finished difference Result 966 states and 1305 transitions. [2018-10-26 20:21:59,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 20:21:59,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-10-26 20:21:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:21:59,136 INFO L225 Difference]: With dead ends: 966 [2018-10-26 20:21:59,136 INFO L226 Difference]: Without dead ends: 828 [2018-10-26 20:21:59,137 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-26 20:21:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-10-26 20:21:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 244. [2018-10-26 20:21:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-26 20:21:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 310 transitions. [2018-10-26 20:21:59,161 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 310 transitions. Word has length 57 [2018-10-26 20:21:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:21:59,161 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 310 transitions. [2018-10-26 20:21:59,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 20:21:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 310 transitions. [2018-10-26 20:21:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 20:21:59,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:21:59,162 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-10-26 20:21:59,162 INFO L424 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:21:59,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1186306092, now seen corresponding path program 1 times [2018-10-26 20:21:59,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:21:59,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:59,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:21:59,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:21:59,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:21:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:21:59,558 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 20:21:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:21:59,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:21:59,637 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:21:59,637 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 20:21:59,637 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [12], [20], [37], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:21:59,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:21:59,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:21:59,645 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:21:59,670 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:21:59,670 INFO L272 AbstractInterpreter]: Visited 32 different actions 37 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:21:59,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:21:59,677 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:21:59,711 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.9% of their original sizes. [2018-10-26 20:21:59,712 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:21:59,808 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 20:21:59,809 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:21:59,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:21:59,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-10-26 20:21:59,809 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:21:59,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:21:59,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:21:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:21:59,810 INFO L87 Difference]: Start difference. First operand 244 states and 310 transitions. Second operand 11 states. [2018-10-26 20:22:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:00,487 INFO L93 Difference]: Finished difference Result 992 states and 1332 transitions. [2018-10-26 20:22:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 20:22:00,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-10-26 20:22:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:00,489 INFO L225 Difference]: With dead ends: 992 [2018-10-26 20:22:00,489 INFO L226 Difference]: Without dead ends: 855 [2018-10-26 20:22:00,490 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:22:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-10-26 20:22:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 242. [2018-10-26 20:22:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-26 20:22:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 307 transitions. [2018-10-26 20:22:00,516 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 307 transitions. Word has length 57 [2018-10-26 20:22:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:00,517 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 307 transitions. [2018-10-26 20:22:00,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 20:22:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 307 transitions. [2018-10-26 20:22:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 20:22:00,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:00,517 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-10-26 20:22:00,518 INFO L424 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:00,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1208741702, now seen corresponding path program 1 times [2018-10-26 20:22:00,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:00,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:00,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:00,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:00,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 20:22:00,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:00,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:22:00,617 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 20:22:00,618 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [15], [20], [23], [34], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:22:00,619 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:22:00,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:22:00,623 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:22:00,637 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:22:00,637 INFO L272 AbstractInterpreter]: Visited 32 different actions 37 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:22:00,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:00,639 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:22:00,672 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.52% of their original sizes. [2018-10-26 20:22:00,673 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:22:00,764 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 20:22:00,764 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:22:00,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:22:00,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-10-26 20:22:00,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:00,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:22:00,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:22:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:22:00,765 INFO L87 Difference]: Start difference. First operand 242 states and 307 transitions. Second operand 11 states. [2018-10-26 20:22:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:01,498 INFO L93 Difference]: Finished difference Result 1007 states and 1346 transitions. [2018-10-26 20:22:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 20:22:01,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-10-26 20:22:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:01,500 INFO L225 Difference]: With dead ends: 1007 [2018-10-26 20:22:01,500 INFO L226 Difference]: Without dead ends: 870 [2018-10-26 20:22:01,500 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:22:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-10-26 20:22:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 245. [2018-10-26 20:22:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-26 20:22:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 312 transitions. [2018-10-26 20:22:01,524 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 312 transitions. Word has length 57 [2018-10-26 20:22:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:01,525 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 312 transitions. [2018-10-26 20:22:01,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 20:22:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 312 transitions. [2018-10-26 20:22:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-26 20:22:01,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:01,528 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-10-26 20:22:01,528 INFO L424 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:01,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:01,528 INFO L82 PathProgramCache]: Analyzing trace with hash -131033476, now seen corresponding path program 1 times [2018-10-26 20:22:01,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:01,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:01,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:01,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:01,529 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 20:22:01,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:01,694 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:22:01,694 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-10-26 20:22:01,694 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [37], [39], [43], [47], [49], [52], [55], [63], [69], [75], [78], [82], [85], [93], [99], [105], [108], [112], [114], [118], [120], [124], [126], [132], [138], [140], [146], [150], [152], [157], [163], [167], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:22:01,695 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:22:01,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:22:01,701 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:22:03,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:22:03,225 INFO L272 AbstractInterpreter]: Visited 51 different actions 1477 times. Merged at 34 different actions 1055 times. Widened at 2 different actions 38 times. Found 367 fixpoints after 15 different actions. Largest state had 23 variables. [2018-10-26 20:22:03,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:03,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:22:03,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:03,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:03,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:03,242 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:22:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:03,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 20:22:03,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:22:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 20:22:03,954 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:22:03,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-10-26 20:22:03,954 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:03,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:22:03,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:22:03,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:22:03,955 INFO L87 Difference]: Start difference. First operand 245 states and 312 transitions. Second operand 4 states. [2018-10-26 20:22:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:05,301 INFO L93 Difference]: Finished difference Result 444 states and 612 transitions. [2018-10-26 20:22:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:22:05,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-10-26 20:22:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:05,303 INFO L225 Difference]: With dead ends: 444 [2018-10-26 20:22:05,303 INFO L226 Difference]: Without dead ends: 307 [2018-10-26 20:22:05,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:22:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-26 20:22:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 288. [2018-10-26 20:22:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-26 20:22:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 361 transitions. [2018-10-26 20:22:05,366 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 361 transitions. Word has length 58 [2018-10-26 20:22:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:05,366 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 361 transitions. [2018-10-26 20:22:05,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:22:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 361 transitions. [2018-10-26 20:22:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:22:05,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:05,370 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] [2018-10-26 20:22:05,370 INFO L424 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:05,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1985992873, now seen corresponding path program 1 times [2018-10-26 20:22:05,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:05,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:05,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:05,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:05,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:22:05,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:05,576 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:22:05,576 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-26 20:22:05,576 INFO L202 CegarAbsIntRunner]: [0], [1], [18], [20], [37], [39], [43], [47], [49], [52], [55], [63], [69], [75], [78], [82], [85], [93], [99], [105], [108], [112], [114], [118], [120], [124], [126], [132], [138], [140], [146], [150], [152], [157], [163], [167], [169], [173], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:22:05,577 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:22:05,577 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:22:05,585 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:22:07,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:22:07,407 INFO L272 AbstractInterpreter]: Visited 53 different actions 1570 times. Merged at 36 different actions 1089 times. Widened at 2 different actions 39 times. Found 421 fixpoints after 19 different actions. Largest state had 23 variables. [2018-10-26 20:22:07,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:07,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:22:07,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:07,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 20:22:07,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:07,465 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:22:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:07,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 20:22:07,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:22:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:22:08,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:22:08,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 11 [2018-10-26 20:22:08,443 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:22:08,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:22:08,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:22:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:22:08,443 INFO L87 Difference]: Start difference. First operand 288 states and 361 transitions. Second operand 7 states. [2018-10-26 20:22:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:09,307 INFO L93 Difference]: Finished difference Result 769 states and 997 transitions. [2018-10-26 20:22:09,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:22:09,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2018-10-26 20:22:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:09,310 INFO L225 Difference]: With dead ends: 769 [2018-10-26 20:22:09,310 INFO L226 Difference]: Without dead ends: 557 [2018-10-26 20:22:09,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:22:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-26 20:22:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 441. [2018-10-26 20:22:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-26 20:22:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 555 transitions. [2018-10-26 20:22:09,385 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 555 transitions. Word has length 65 [2018-10-26 20:22:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:09,385 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 555 transitions. [2018-10-26 20:22:09,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:22:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 555 transitions. [2018-10-26 20:22:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:22:09,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:09,389 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] [2018-10-26 20:22:09,389 INFO L424 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:09,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash -86525159, now seen corresponding path program 1 times [2018-10-26 20:22:09,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:09,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:09,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 20:22:09,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:09,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:22:09,527 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-26 20:22:09,527 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [20], [23], [34], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [173], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:22:09,528 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:22:09,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:22:09,541 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:22:09,584 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:22:09,584 INFO L272 AbstractInterpreter]: Visited 33 different actions 37 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:22:09,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:09,634 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:22:09,701 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 75.57% of their original sizes. [2018-10-26 20:22:09,704 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:22:09,992 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-10-26 20:22:09,992 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:22:09,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:22:09,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-10-26 20:22:09,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:09,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 20:22:09,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 20:22:09,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:22:09,994 INFO L87 Difference]: Start difference. First operand 441 states and 555 transitions. Second operand 14 states. [2018-10-26 20:22:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:13,714 INFO L93 Difference]: Finished difference Result 1403 states and 1820 transitions. [2018-10-26 20:22:13,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:22:13,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-10-26 20:22:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:13,717 INFO L225 Difference]: With dead ends: 1403 [2018-10-26 20:22:13,717 INFO L226 Difference]: Without dead ends: 1222 [2018-10-26 20:22:13,720 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:22:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2018-10-26 20:22:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 442. [2018-10-26 20:22:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-10-26 20:22:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2018-10-26 20:22:13,797 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 65 [2018-10-26 20:22:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:13,797 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2018-10-26 20:22:13,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 20:22:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2018-10-26 20:22:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:22:13,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:13,798 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] [2018-10-26 20:22:13,798 INFO L424 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:13,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:13,799 INFO L82 PathProgramCache]: Analyzing trace with hash -45850409, now seen corresponding path program 1 times [2018-10-26 20:22:13,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:13,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:13,799 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:14,391 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-10-26 20:22:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 20:22:14,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:14,618 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:22:14,618 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-26 20:22:14,619 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [7], [12], [20], [23], [34], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [173], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:22:14,619 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:22:14,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:22:14,624 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:22:14,649 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:22:14,649 INFO L272 AbstractInterpreter]: Visited 33 different actions 38 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:22:14,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:14,694 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:22:14,751 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 75.64% of their original sizes. [2018-10-26 20:22:14,751 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:22:14,940 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-10-26 20:22:14,940 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:22:14,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:22:14,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-10-26 20:22:14,941 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:14,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:22:14,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:22:14,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:22:14,941 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 12 states. [2018-10-26 20:22:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:17,574 INFO L93 Difference]: Finished difference Result 1406 states and 1823 transitions. [2018-10-26 20:22:17,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 20:22:17,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-10-26 20:22:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:17,577 INFO L225 Difference]: With dead ends: 1406 [2018-10-26 20:22:17,577 INFO L226 Difference]: Without dead ends: 1226 [2018-10-26 20:22:17,580 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-26 20:22:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2018-10-26 20:22:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 439. [2018-10-26 20:22:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-26 20:22:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 552 transitions. [2018-10-26 20:22:17,656 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 552 transitions. Word has length 65 [2018-10-26 20:22:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:17,656 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 552 transitions. [2018-10-26 20:22:17,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:22:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 552 transitions. [2018-10-26 20:22:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:22:17,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:17,661 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] [2018-10-26 20:22:17,661 INFO L424 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:17,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1002521586, now seen corresponding path program 1 times [2018-10-26 20:22:17,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:17,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:17,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:17,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:17,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:18,242 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-26 20:22:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 20:22:18,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:18,312 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:22:18,312 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-26 20:22:18,312 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [15], [20], [23], [26], [29], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [173], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:22:18,313 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:22:18,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:22:18,325 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:22:18,342 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:22:18,342 INFO L272 AbstractInterpreter]: Visited 33 different actions 38 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:22:18,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:18,343 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:22:18,377 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 75.27% of their original sizes. [2018-10-26 20:22:18,378 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:22:18,503 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-10-26 20:22:18,503 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:22:18,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:22:18,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2018-10-26 20:22:18,504 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:18,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 20:22:18,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 20:22:18,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-10-26 20:22:18,504 INFO L87 Difference]: Start difference. First operand 439 states and 552 transitions. Second operand 13 states. [2018-10-26 20:22:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:19,790 INFO L93 Difference]: Finished difference Result 1419 states and 1836 transitions. [2018-10-26 20:22:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:22:19,790 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-10-26 20:22:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:19,793 INFO L225 Difference]: With dead ends: 1419 [2018-10-26 20:22:19,793 INFO L226 Difference]: Without dead ends: 1238 [2018-10-26 20:22:19,794 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:22:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-10-26 20:22:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 470. [2018-10-26 20:22:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-26 20:22:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 587 transitions. [2018-10-26 20:22:19,890 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 587 transitions. Word has length 65 [2018-10-26 20:22:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:19,892 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 587 transitions. [2018-10-26 20:22:19,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 20:22:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 587 transitions. [2018-10-26 20:22:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:22:19,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:19,893 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] [2018-10-26 20:22:19,893 INFO L424 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:19,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:19,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1446422260, now seen corresponding path program 1 times [2018-10-26 20:22:19,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:19,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:19,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:19,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:19,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 20:22:20,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:20,126 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:22:20,126 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-26 20:22:20,126 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [15], [20], [23], [26], [31], [39], [43], [47], [49], [52], [55], [63], [69], [75], [82], [85], [93], [99], [105], [114], [118], [126], [132], [138], [140], [146], [150], [152], [157], [161], [163], [167], [169], [173], [175], [177], [181], [182], [186], [188], [192], [195], [197], [203], [204], [205], [207], [208], [209] [2018-10-26 20:22:20,127 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:22:20,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:22:20,134 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:22:20,160 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 20:22:20,160 INFO L272 AbstractInterpreter]: Visited 33 different actions 38 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-10-26 20:22:20,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:20,200 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 20:22:20,246 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 75.27% of their original sizes. [2018-10-26 20:22:20,246 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 20:22:20,365 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-10-26 20:22:20,365 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 20:22:20,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:22:20,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-10-26 20:22:20,366 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:22:20,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:22:20,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:22:20,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:22:20,366 INFO L87 Difference]: Start difference. First operand 470 states and 587 transitions. Second operand 12 states. [2018-10-26 20:22:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:21,465 INFO L93 Difference]: Finished difference Result 1440 states and 1858 transitions. [2018-10-26 20:22:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 20:22:21,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-10-26 20:22:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:21,468 INFO L225 Difference]: With dead ends: 1440 [2018-10-26 20:22:21,468 INFO L226 Difference]: Without dead ends: 1260 [2018-10-26 20:22:21,469 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-10-26 20:22:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2018-10-26 20:22:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 470. [2018-10-26 20:22:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-26 20:22:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 587 transitions. [2018-10-26 20:22:21,526 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 587 transitions. Word has length 65 [2018-10-26 20:22:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:21,526 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 587 transitions. [2018-10-26 20:22:21,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:22:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 587 transitions. [2018-10-26 20:22:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 20:22:21,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:21,527 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-10-26 20:22:21,527 INFO L424 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:21,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1946768196, now seen corresponding path program 1 times [2018-10-26 20:22:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:22:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:22:21,528 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:22:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:22:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:22:21,578 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:22:21,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:22:21 BoogieIcfgContainer [2018-10-26 20:22:21,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:22:21,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:22:21,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:22:21,653 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:22:21,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:21:11" (3/4) ... [2018-10-26 20:22:21,657 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 20:22:21,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:22:21,662 INFO L168 Benchmark]: Toolchain (without parser) took 71084.66 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 767.0 MB). Free memory was 955.8 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 621.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:21,663 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:22:21,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.67 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 942.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:21,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.17 ms. Allocated memory is still 1.0 GB. Free memory is still 942.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:22:21,663 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:21,664 INFO L168 Benchmark]: RCFGBuilder took 689.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:21,664 INFO L168 Benchmark]: TraceAbstraction took 70124.73 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 625.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 632.0 MB. Max. memory is 11.5 GB. [2018-10-26 20:22:21,664 INFO L168 Benchmark]: Witness Printer took 8.43 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:22:21,669 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.67 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 942.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 19.17 ms. Allocated memory is still 1.0 GB. Free memory is still 942.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 689.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 70124.73 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 625.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 632.0 MB. Max. memory is 11.5 GB. * Witness Printer took 8.43 ms. Allocated memory is still 1.8 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, 70.0s OverallTime, 37 OverallIterations, 4 TraceHistogramMax, 46.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6277 SDtfs, 9372 SDslu, 18925 SDs, 0 SdLazy, 8001 SolverSat, 441 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 54 DeclaredPredicates, 1729 GetRequests, 1464 SyntacticMatches, 6 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 29 AbstIntIterations, 27 AbstIntStrong, 0.9738582005423356 AbsIntWeakeningRatio, 0.7154870357393133 AbsIntAvgWeakeningVarsNumRemoved, 5.6846531184302735 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 16465 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 2018 NumberOfCodeBlocks, 2018 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2035 ConstructedInterpolants, 31 QuantifiedInterpolants, 469663 SizeOfPredicates, 6 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 40 InterpolantComputations, 9 PerfectInterpolantSequences, 633/744 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-1dbac8b [2018-10-26 20:22:23,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:22:23,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:22:23,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:22:23,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:22:23,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:22:23,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:22:23,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:22:23,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:22:23,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:22:23,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:22:23,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:22:23,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:22:23,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:22:23,489 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:22:23,489 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:22:23,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:22:23,492 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:22:23,493 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:22:23,494 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:22:23,495 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:22:23,496 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:22:23,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:22:23,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:22:23,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:22:23,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:22:23,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:22:23,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:22:23,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:22:23,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:22:23,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:22:23,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:22:23,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:22:23,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:22:23,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:22:23,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:22:23,506 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 20:22:23,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:22:23,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:22:23,518 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:22:23,518 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:22:23,518 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:22:23,518 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:22:23,518 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:22:23,518 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:22:23,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:22:23,519 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:22:23,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:22:23,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:22:23,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:22:23,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:22:23,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:22:23,520 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 20:22:23,521 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 20:22:23,521 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:22:23,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:22:23,522 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:22:23,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:22:23,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:22:23,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:22:23,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:22:23,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:22:23,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:22:23,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:22:23,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:22:23,523 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 20:22:23,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:22:23,523 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 20:22:23,523 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 20:22:23,524 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_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:23,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:22:23,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:22:23,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:22:23,571 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:22:23,571 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:22:23,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-10-26 20:22:23,619 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data/abe81fbe9/ab6daa47416c4216b7caa8575386e558/FLAG6de6123f5 [2018-10-26 20:22:24,025 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:22:24,025 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-10-26 20:22:24,039 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data/abe81fbe9/ab6daa47416c4216b7caa8575386e558/FLAG6de6123f5 [2018-10-26 20:22:24,055 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/data/abe81fbe9/ab6daa47416c4216b7caa8575386e558 [2018-10-26 20:22:24,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:22:24,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:22:24,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:22:24,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:22:24,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:22:24,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1791a6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24, skipping insertion in model container [2018-10-26 20:22:24,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:22:24,110 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:22:24,309 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:22:24,320 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:22:24,381 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:22:24,398 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:22:24,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24 WrapperNode [2018-10-26 20:22:24,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:22:24,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:22:24,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:22:24,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:22:24,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:22:24,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:22:24,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:22:24,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:22:24,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... [2018-10-26 20:22:24,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:22:24,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:22:24,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:22:24,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:22:24,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:24,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:22:24,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:22:24,562 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-10-26 20:22:24,562 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-10-26 20:22:24,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:22:24,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:22:24,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:22:24,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:22:24,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 20:22:24,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 20:22:25,061 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:22:25,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:22:25 BoogieIcfgContainer [2018-10-26 20:22:25,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:22:25,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:22:25,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:22:25,065 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:22:25,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:22:24" (1/3) ... [2018-10-26 20:22:25,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370ee11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:22:25, skipping insertion in model container [2018-10-26 20:22:25,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:22:24" (2/3) ... [2018-10-26 20:22:25,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370ee11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:22:25, skipping insertion in model container [2018-10-26 20:22:25,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:22:25" (3/3) ... [2018-10-26 20:22:25,069 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-10-26 20:22:25,079 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:22:25,085 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:22:25,099 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:22:25,128 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:22:25,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:22:25,129 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:22:25,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:22:25,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:22:25,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:22:25,129 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:22:25,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:22:25,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:22:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-10-26 20:22:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:22:25,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:25,153 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-10-26 20:22:25,155 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:25,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash 572437916, now seen corresponding path program 1 times [2018-10-26 20:22:25,163 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:25,163 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:25,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:25,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:25,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:25,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:22:25,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 20:22:25,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 20:22:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:22:25,268 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-10-26 20:22:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:25,290 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-10-26 20:22:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 20:22:25,291 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-26 20:22:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:25,302 INFO L225 Difference]: With dead ends: 79 [2018-10-26 20:22:25,302 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 20:22:25,306 INFO L605 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-10-26 20:22:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 20:22:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-26 20:22:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 20:22:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-10-26 20:22:25,345 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 21 [2018-10-26 20:22:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:25,346 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-10-26 20:22:25,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 20:22:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-10-26 20:22:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:22:25,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:25,347 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-10-26 20:22:25,348 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:25,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:25,348 INFO L82 PathProgramCache]: Analyzing trace with hash 855921951, now seen corresponding path program 1 times [2018-10-26 20:22:25,348 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:25,348 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:25,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:25,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:25,533 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:25,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:25,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:22:25,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:22:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:22:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:25,537 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 4 states. [2018-10-26 20:22:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:26,475 INFO L93 Difference]: Finished difference Result 138 states and 227 transitions. [2018-10-26 20:22:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:22:26,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-26 20:22:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:26,478 INFO L225 Difference]: With dead ends: 138 [2018-10-26 20:22:26,479 INFO L226 Difference]: Without dead ends: 104 [2018-10-26 20:22:26,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-26 20:22:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-10-26 20:22:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-26 20:22:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2018-10-26 20:22:26,493 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 23 [2018-10-26 20:22:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:26,494 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2018-10-26 20:22:26,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:22:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2018-10-26 20:22:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:22:26,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:26,496 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-10-26 20:22:26,499 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:26,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:26,499 INFO L82 PathProgramCache]: Analyzing trace with hash -937448708, now seen corresponding path program 1 times [2018-10-26 20:22:26,500 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:26,500 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:26,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:26,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:26,590 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:26,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:22:26,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:22:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:22:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:22:26,598 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 5 states. [2018-10-26 20:22:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:27,269 INFO L93 Difference]: Finished difference Result 191 states and 306 transitions. [2018-10-26 20:22:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:22:27,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-10-26 20:22:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:27,272 INFO L225 Difference]: With dead ends: 191 [2018-10-26 20:22:27,273 INFO L226 Difference]: Without dead ends: 157 [2018-10-26 20:22:27,273 INFO L605 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-10-26 20:22:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-26 20:22:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2018-10-26 20:22:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-26 20:22:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2018-10-26 20:22:27,289 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 24 [2018-10-26 20:22:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:27,290 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2018-10-26 20:22:27,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:22:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2018-10-26 20:22:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:22:27,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:27,292 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-10-26 20:22:27,292 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:27,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1385230186, now seen corresponding path program 1 times [2018-10-26 20:22:27,293 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:27,293 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:27,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:27,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:27,400 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:27,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:27,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:22:27,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:22:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:22:27,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:22:27,407 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 7 states. [2018-10-26 20:22:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:27,823 INFO L93 Difference]: Finished difference Result 240 states and 377 transitions. [2018-10-26 20:22:27,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:22:27,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-10-26 20:22:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:27,825 INFO L225 Difference]: With dead ends: 240 [2018-10-26 20:22:27,826 INFO L226 Difference]: Without dead ends: 206 [2018-10-26 20:22:27,826 INFO L605 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-10-26 20:22:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-26 20:22:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2018-10-26 20:22:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-26 20:22:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 204 transitions. [2018-10-26 20:22:27,843 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 204 transitions. Word has length 25 [2018-10-26 20:22:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:27,844 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 204 transitions. [2018-10-26 20:22:27,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:22:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 204 transitions. [2018-10-26 20:22:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:22:27,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:27,845 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-10-26 20:22:27,847 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:27,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash 364161832, now seen corresponding path program 1 times [2018-10-26 20:22:27,847 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:27,848 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:27,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:27,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:27,927 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:27,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:22:27,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:22:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:22:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:22:27,936 INFO L87 Difference]: Start difference. First operand 135 states and 204 transitions. Second operand 6 states. [2018-10-26 20:22:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:28,241 INFO L93 Difference]: Finished difference Result 260 states and 399 transitions. [2018-10-26 20:22:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:22:28,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-10-26 20:22:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:28,243 INFO L225 Difference]: With dead ends: 260 [2018-10-26 20:22:28,243 INFO L226 Difference]: Without dead ends: 226 [2018-10-26 20:22:28,244 INFO L605 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-10-26 20:22:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-26 20:22:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 105. [2018-10-26 20:22:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-26 20:22:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2018-10-26 20:22:28,256 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 25 [2018-10-26 20:22:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:28,257 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2018-10-26 20:22:28,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:22:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2018-10-26 20:22:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 20:22:28,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:28,259 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-10-26 20:22:28,260 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:28,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash 938751165, now seen corresponding path program 1 times [2018-10-26 20:22:28,261 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:28,261 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:28,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:28,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:28,317 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:28,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:28,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:22:28,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:22:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:22:28,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:22:28,323 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand 3 states. [2018-10-26 20:22:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:28,336 INFO L93 Difference]: Finished difference Result 146 states and 205 transitions. [2018-10-26 20:22:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:22:28,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-26 20:22:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:28,338 INFO L225 Difference]: With dead ends: 146 [2018-10-26 20:22:28,338 INFO L226 Difference]: Without dead ends: 127 [2018-10-26 20:22:28,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-10-26 20:22:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-26 20:22:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-26 20:22:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-26 20:22:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2018-10-26 20:22:28,352 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 37 [2018-10-26 20:22:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:28,353 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2018-10-26 20:22:28,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:22:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2018-10-26 20:22:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 20:22:28,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:28,356 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-10-26 20:22:28,356 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:28,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:28,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1055393541, now seen corresponding path program 1 times [2018-10-26 20:22:28,357 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:28,357 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:28,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:28,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:28,417 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:28,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:28,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:22:28,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:22:28,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:22:28,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:22:28,423 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand 4 states. [2018-10-26 20:22:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:28,543 INFO L93 Difference]: Finished difference Result 336 states and 478 transitions. [2018-10-26 20:22:28,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:22:28,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-26 20:22:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:28,545 INFO L225 Difference]: With dead ends: 336 [2018-10-26 20:22:28,545 INFO L226 Difference]: Without dead ends: 236 [2018-10-26 20:22:28,546 INFO L605 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-10-26 20:22:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-26 20:22:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2018-10-26 20:22:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-26 20:22:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 308 transitions. [2018-10-26 20:22:28,559 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 308 transitions. Word has length 37 [2018-10-26 20:22:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:28,560 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 308 transitions. [2018-10-26 20:22:28,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:22:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 308 transitions. [2018-10-26 20:22:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 20:22:28,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:28,563 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-10-26 20:22:28,563 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:28,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:28,563 INFO L82 PathProgramCache]: Analyzing trace with hash 154938663, now seen corresponding path program 1 times [2018-10-26 20:22:28,564 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:28,564 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:28,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:28,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:28,725 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:28,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:28,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:22:28,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:22:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:22:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:22:28,728 INFO L87 Difference]: Start difference. First operand 217 states and 308 transitions. Second operand 5 states. [2018-10-26 20:22:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:28,988 INFO L93 Difference]: Finished difference Result 439 states and 624 transitions. [2018-10-26 20:22:28,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:22:28,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-26 20:22:28,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:28,990 INFO L225 Difference]: With dead ends: 439 [2018-10-26 20:22:28,990 INFO L226 Difference]: Without dead ends: 339 [2018-10-26 20:22:28,990 INFO L605 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-10-26 20:22:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-26 20:22:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 217. [2018-10-26 20:22:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-26 20:22:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 308 transitions. [2018-10-26 20:22:29,007 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 308 transitions. Word has length 38 [2018-10-26 20:22:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:29,007 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 308 transitions. [2018-10-26 20:22:29,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:22:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 308 transitions. [2018-10-26 20:22:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:22:29,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:29,009 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-10-26 20:22:29,009 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:29,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash 157856934, now seen corresponding path program 1 times [2018-10-26 20:22:29,009 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:29,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:29,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:29,087 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:29,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:29,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:22:29,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:22:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:22:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:22:29,096 INFO L87 Difference]: Start difference. First operand 217 states and 308 transitions. Second operand 7 states. [2018-10-26 20:22:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:29,387 INFO L93 Difference]: Finished difference Result 536 states and 758 transitions. [2018-10-26 20:22:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:22:29,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-10-26 20:22:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:29,389 INFO L225 Difference]: With dead ends: 536 [2018-10-26 20:22:29,390 INFO L226 Difference]: Without dead ends: 436 [2018-10-26 20:22:29,390 INFO L605 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-10-26 20:22:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-26 20:22:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 299. [2018-10-26 20:22:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-26 20:22:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 420 transitions. [2018-10-26 20:22:29,404 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 420 transitions. Word has length 39 [2018-10-26 20:22:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:29,404 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 420 transitions. [2018-10-26 20:22:29,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:22:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 420 transitions. [2018-10-26 20:22:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:22:29,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:29,407 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-10-26 20:22:29,407 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:29,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash -351616156, now seen corresponding path program 1 times [2018-10-26 20:22:29,408 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:29,408 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:22:29,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:29,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:29,486 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:22:29,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:22:29,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:22:29,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:22:29,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:22:29,488 INFO L87 Difference]: Start difference. First operand 299 states and 420 transitions. Second operand 6 states. [2018-10-26 20:22:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:29,705 INFO L93 Difference]: Finished difference Result 534 states and 752 transitions. [2018-10-26 20:22:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:22:29,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-10-26 20:22:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:29,707 INFO L225 Difference]: With dead ends: 534 [2018-10-26 20:22:29,707 INFO L226 Difference]: Without dead ends: 434 [2018-10-26 20:22:29,708 INFO L605 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-10-26 20:22:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-26 20:22:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 209. [2018-10-26 20:22:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-26 20:22:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 290 transitions. [2018-10-26 20:22:29,720 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 290 transitions. Word has length 39 [2018-10-26 20:22:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:29,720 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 290 transitions. [2018-10-26 20:22:29,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:22:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 290 transitions. [2018-10-26 20:22:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 20:22:29,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:29,721 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-10-26 20:22:29,723 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:29,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash -433809, now seen corresponding path program 1 times [2018-10-26 20:22:29,723 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:29,724 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:22:29,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:29,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:29,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:22:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:29,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:29,832 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:22:29,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:29,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:29,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:22:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:22:29,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 20:22:29,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4, 4] total 12 [2018-10-26 20:22:29,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:22:29,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:22:29,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:22:29,934 INFO L87 Difference]: Start difference. First operand 209 states and 290 transitions. Second operand 12 states. [2018-10-26 20:22:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:32,616 INFO L93 Difference]: Finished difference Result 1326 states and 2055 transitions. [2018-10-26 20:22:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 20:22:32,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-10-26 20:22:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:32,621 INFO L225 Difference]: With dead ends: 1326 [2018-10-26 20:22:32,621 INFO L226 Difference]: Without dead ends: 1147 [2018-10-26 20:22:32,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2018-10-26 20:22:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2018-10-26 20:22:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 852. [2018-10-26 20:22:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-10-26 20:22:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1244 transitions. [2018-10-26 20:22:32,684 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1244 transitions. Word has length 41 [2018-10-26 20:22:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:32,685 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1244 transitions. [2018-10-26 20:22:32,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:22:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1244 transitions. [2018-10-26 20:22:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 20:22:32,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:32,688 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-10-26 20:22:32,689 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:32,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 797419983, now seen corresponding path program 1 times [2018-10-26 20:22:32,690 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:32,691 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:22:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:32,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 20:22:32,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:22:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 20:22:33,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:33,051 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:22:33,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:33,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 20:22:33,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:22:33,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:22:33,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2018-10-26 20:22:33,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:22:33,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:22:33,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:22:33,287 INFO L87 Difference]: Start difference. First operand 852 states and 1244 transitions. Second operand 9 states. [2018-10-26 20:22:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:22:35,364 INFO L93 Difference]: Finished difference Result 2412 states and 3582 transitions. [2018-10-26 20:22:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:22:35,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-10-26 20:22:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:22:35,369 INFO L225 Difference]: With dead ends: 2412 [2018-10-26 20:22:35,369 INFO L226 Difference]: Without dead ends: 1968 [2018-10-26 20:22:35,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-10-26 20:22:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-10-26 20:22:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1598. [2018-10-26 20:22:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-10-26 20:22:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2308 transitions. [2018-10-26 20:22:35,454 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2308 transitions. Word has length 64 [2018-10-26 20:22:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:22:35,455 INFO L481 AbstractCegarLoop]: Abstraction has 1598 states and 2308 transitions. [2018-10-26 20:22:35,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:22:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2308 transitions. [2018-10-26 20:22:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 20:22:35,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:22:35,458 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-10-26 20:22:35,458 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:22:35,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:22:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1946768196, now seen corresponding path program 1 times [2018-10-26 20:22:35,459 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:22:35,459 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:22:35,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:35,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 20:22:36,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:22:37,161 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-26 20:22:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 20:22:39,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:22:39,662 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:22:39,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:22:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:22:39,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:22:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 20:22:40,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:22:40,352 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-10-26 20:22:40,531 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-26 20:22:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 20:22:41,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 20:22:41,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23] total 50 [2018-10-26 20:22:41,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-26 20:22:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-26 20:22:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2237, Unknown=0, NotChecked=0, Total=2450 [2018-10-26 20:22:41,198 INFO L87 Difference]: Start difference. First operand 1598 states and 2308 transitions. Second operand 50 states. [2018-10-26 20:22:46,373 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-10-26 20:22:50,170 WARN L179 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-26 20:22:52,922 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-10-26 20:22:54,255 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-10-26 20:22:58,894 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2018-10-26 20:22:59,772 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2018-10-26 20:23:01,458 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-10-26 20:23:05,902 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-10-26 20:23:06,358 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-10-26 20:23:10,384 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-10-26 20:23:10,885 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-10-26 20:23:11,739 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2018-10-26 20:23:13,650 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-10-26 20:23:14,683 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2018-10-26 20:23:15,668 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-10-26 20:23:16,142 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-10-26 20:23:17,335 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2018-10-26 20:23:18,308 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2018-10-26 20:23:19,142 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-10-26 20:23:22,239 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2018-10-26 20:23:22,703 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-10-26 20:23:24,691 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-10-26 20:23:25,084 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2018-10-26 20:23:26,621 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-10-26 20:23:30,414 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-10-26 20:23:31,968 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-10-26 20:23:32,322 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-10-26 20:23:33,057 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-10-26 20:23:33,477 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-10-26 20:23:34,481 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-10-26 20:23:35,006 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-10-26 20:23:35,471 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2018-10-26 20:23:35,934 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-10-26 20:23:36,468 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2018-10-26 20:23:37,555 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2018-10-26 20:23:38,102 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-10-26 20:23:38,678 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2018-10-26 20:23:39,299 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-10-26 20:23:39,697 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-10-26 20:23:40,509 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-10-26 20:23:41,953 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-10-26 20:23:42,564 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-10-26 20:23:43,294 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-10-26 20:23:44,938 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-10-26 20:23:45,309 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2018-10-26 20:23:45,945 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2018-10-26 20:23:46,589 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-10-26 20:23:47,490 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-10-26 20:23:47,819 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-10-26 20:23:48,480 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-10-26 20:23:48,866 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-10-26 20:23:49,635 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2018-10-26 20:23:50,348 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-10-26 20:23:50,978 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2018-10-26 20:23:52,316 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-10-26 20:23:52,656 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-10-26 20:23:53,002 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2018-10-26 20:23:53,791 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2018-10-26 20:23:54,324 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-10-26 20:23:55,478 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-10-26 20:23:56,114 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-10-26 20:23:57,069 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2018-10-26 20:23:57,820 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-10-26 20:23:58,938 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-10-26 20:23:59,536 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-10-26 20:24:01,002 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-10-26 20:24:01,964 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-10-26 20:24:02,757 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-10-26 20:24:03,393 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2018-10-26 20:24:04,420 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-10-26 20:24:04,980 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2018-10-26 20:24:05,999 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-10-26 20:24:07,558 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-10-26 20:24:08,064 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-26 20:24:08,418 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-10-26 20:24:09,151 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-10-26 20:24:09,972 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-10-26 20:24:10,590 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-10-26 20:24:11,123 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-10-26 20:24:11,824 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-10-26 20:24:12,220 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-10-26 20:24:13,182 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-10-26 20:24:13,817 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-10-26 20:24:14,448 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 115 [2018-10-26 20:24:15,613 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2018-10-26 20:24:16,437 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-10-26 20:24:17,667 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2018-10-26 20:24:18,415 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-10-26 20:24:19,466 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-10-26 20:24:20,423 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-10-26 20:24:21,355 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2018-10-26 20:24:22,016 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2018-10-26 20:24:22,588 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-10-26 20:24:23,395 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2018-10-26 20:24:24,256 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-10-26 20:24:25,294 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-10-26 20:24:26,868 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2018-10-26 20:24:27,438 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2018-10-26 20:24:28,207 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 118 [2018-10-26 20:24:29,040 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-10-26 20:24:30,878 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-10-26 20:24:31,392 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-10-26 20:24:32,246 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-10-26 20:24:33,355 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-10-26 20:24:34,388 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-10-26 20:24:35,256 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-10-26 20:24:36,010 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-10-26 20:24:36,996 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-10-26 20:24:38,177 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2018-10-26 20:24:38,826 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2018-10-26 20:24:39,095 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-10-26 20:24:40,100 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-10-26 20:24:40,756 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2018-10-26 20:24:41,401 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 121 [2018-10-26 20:24:42,108 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2018-10-26 20:24:42,736 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2018-10-26 20:24:43,610 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2018-10-26 20:24:45,374 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2018-10-26 20:24:46,250 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2018-10-26 20:24:46,641 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-10-26 20:24:47,387 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2018-10-26 20:24:48,223 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-10-26 20:24:49,422 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-10-26 20:24:50,088 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-10-26 20:24:50,827 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 111 [2018-10-26 20:24:51,808 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-10-26 20:24:52,776 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-10-26 20:24:54,756 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2018-10-26 20:24:55,454 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2018-10-26 20:24:56,371 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-10-26 20:24:57,771 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-10-26 20:24:58,620 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-10-26 20:24:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:24:58,648 INFO L93 Difference]: Finished difference Result 11705 states and 17008 transitions. [2018-10-26 20:24:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2018-10-26 20:24:58,649 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-10-26 20:24:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:24:58,679 INFO L225 Difference]: With dead ends: 11705 [2018-10-26 20:24:58,679 INFO L226 Difference]: Without dead ends: 11269 [2018-10-26 20:24:58,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45854 ImplicationChecksByTransitivity, 120.5s TimeCoverageRelationStatistics Valid=22983, Invalid=99867, Unknown=0, NotChecked=0, Total=122850 [2018-10-26 20:24:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2018-10-26 20:24:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 4071. [2018-10-26 20:24:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4071 states. [2018-10-26 20:24:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 6085 transitions. [2018-10-26 20:24:58,977 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 6085 transitions. Word has length 66 [2018-10-26 20:24:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:24:58,978 INFO L481 AbstractCegarLoop]: Abstraction has 4071 states and 6085 transitions. [2018-10-26 20:24:58,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-26 20:24:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6085 transitions. [2018-10-26 20:24:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 20:24:58,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:24:58,981 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-10-26 20:24:58,981 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:24:58,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:24:58,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1129119746, now seen corresponding path program 1 times [2018-10-26 20:24:58,983 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:24:58,983 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:24:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:24:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:24:59,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:24:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:24:59,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:24:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:24:59,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:24:59,250 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 20:24:59,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:24:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:24:59,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:24:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:24:59,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:24:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:24:59,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 20:24:59,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 4] total 10 [2018-10-26 20:24:59,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:24:59,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:24:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:24:59,381 INFO L87 Difference]: Start difference. First operand 4071 states and 6085 transitions. Second operand 10 states. [2018-10-26 20:25:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:25:00,466 INFO L93 Difference]: Finished difference Result 9893 states and 14976 transitions. [2018-10-26 20:25:00,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 20:25:00,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-10-26 20:25:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:25:00,480 INFO L225 Difference]: With dead ends: 9893 [2018-10-26 20:25:00,480 INFO L226 Difference]: Without dead ends: 5870 [2018-10-26 20:25:00,486 INFO L605 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-10-26 20:25:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5870 states. [2018-10-26 20:25:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5870 to 4982. [2018-10-26 20:25:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4982 states. [2018-10-26 20:25:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 6892 transitions. [2018-10-26 20:25:00,777 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 6892 transitions. Word has length 66 [2018-10-26 20:25:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:25:00,778 INFO L481 AbstractCegarLoop]: Abstraction has 4982 states and 6892 transitions. [2018-10-26 20:25:00,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:25:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 6892 transitions. [2018-10-26 20:25:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 20:25:00,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:25:00,780 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-10-26 20:25:00,780 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:25:00,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:25:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1904298426, now seen corresponding path program 1 times [2018-10-26 20:25:00,781 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:25:00,781 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:25:00,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:25:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:25:00,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:25:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 20:25:01,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:25:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-26 20:25:01,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:25:01,095 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:25:01,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:25:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:25:01,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:25:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 20:25:01,153 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:25:01,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:25:01,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2018-10-26 20:25:01,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 20:25:01,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 20:25:01,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:25:01,176 INFO L87 Difference]: Start difference. First operand 4982 states and 6892 transitions. Second operand 14 states. [2018-10-26 20:25:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:25:02,484 INFO L93 Difference]: Finished difference Result 11501 states and 16017 transitions. [2018-10-26 20:25:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 20:25:02,484 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-10-26 20:25:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:25:02,497 INFO L225 Difference]: With dead ends: 11501 [2018-10-26 20:25:02,497 INFO L226 Difference]: Without dead ends: 6342 [2018-10-26 20:25:02,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2018-10-26 20:25:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6342 states. [2018-10-26 20:25:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6342 to 3707. [2018-10-26 20:25:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2018-10-26 20:25:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4592 transitions. [2018-10-26 20:25:02,723 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4592 transitions. Word has length 66 [2018-10-26 20:25:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:25:02,723 INFO L481 AbstractCegarLoop]: Abstraction has 3707 states and 4592 transitions. [2018-10-26 20:25:02,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 20:25:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4592 transitions. [2018-10-26 20:25:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 20:25:02,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:25:02,726 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-10-26 20:25:02,726 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:25:02,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:25:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash 446581663, now seen corresponding path program 1 times [2018-10-26 20:25:02,726 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:25:02,726 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/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-10-26 20:25:02,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:25:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:25:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:25:02,873 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:25:02,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:25:02 BoogieIcfgContainer [2018-10-26 20:25:02,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:25:02,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:25:02,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:25:02,935 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:25:02,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:22:25" (3/4) ... [2018-10-26 20:25:02,939 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:25:03,114 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fb3e803e-c1c9-4ffb-90b8-41b19528fa8d/bin-2019/utaipan/witness.graphml [2018-10-26 20:25:03,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:25:03,117 INFO L168 Benchmark]: Toolchain (without parser) took 159059.49 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 355.5 MB). Free memory was 953.2 MB in the beginning and 1.3 GB in the end (delta: -351.2 MB). Peak memory consumption was 479.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:25:03,120 INFO L168 Benchmark]: CDTParser took 0.15 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-10-26 20:25:03,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.01 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:25:03,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.27 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:25:03,120 INFO L168 Benchmark]: Boogie Preprocessor took 41.23 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:25:03,121 INFO L168 Benchmark]: RCFGBuilder took 600.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 931.8 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:25:03,122 INFO L168 Benchmark]: TraceAbstraction took 157872.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 825.1 MB in the end (delta: 314.8 MB). Peak memory consumption was 479.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:25:03,122 INFO L168 Benchmark]: Witness Printer took 181.52 ms. Allocated memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.2 MB). Free memory was 825.1 MB in the beginning and 1.3 GB in the end (delta: -479.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:25:03,124 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.15 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 339.01 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 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 20.27 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.23 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 600.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 931.8 MB in the beginning and 1.1 GB in the end (delta: -208.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 157872.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 825.1 MB in the end (delta: 314.8 MB). Peak memory consumption was 479.9 MB. Max. memory is 11.5 GB. * Witness Printer took 181.52 ms. Allocated memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.2 MB). Free memory was 825.1 MB in the beginning and 1.3 GB in the end (delta: -479.4 MB). Peak memory consumption was 9.9 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, 157.8s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 148.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1948 SDtfs, 7198 SDslu, 10816 SDs, 0 SdLazy, 17516 SolverSat, 1357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1746 GetRequests, 1266 SyntacticMatches, 9 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46392 ImplicationChecksByTransitivity, 122.8s 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: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 12144 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 983 NumberOfCodeBlocks, 983 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 822203 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1578 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 328/424 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...