./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_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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-11-10 02:29:35,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:29:35,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:29:35,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:29:35,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:29:35,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:29:35,244 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:29:35,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:29:35,247 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:29:35,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:29:35,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:29:35,249 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:29:35,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:29:35,250 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:29:35,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:29:35,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:29:35,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:29:35,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:29:35,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:29:35,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:29:35,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:29:35,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:29:35,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:29:35,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:29:35,262 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:29:35,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:29:35,264 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:29:35,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:29:35,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:29:35,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:29:35,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:29:35,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:29:35,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:29:35,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:29:35,268 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:29:35,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:29:35,269 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 02:29:35,279 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:29:35,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:29:35,280 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:29:35,280 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 02:29:35,281 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 02:29:35,281 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 02:29:35,281 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 02:29:35,281 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 02:29:35,281 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 02:29:35,282 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 02:29:35,282 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 02:29:35,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:29:35,283 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:29:35,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:29:35,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:29:35,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:29:35,283 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:29:35,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:29:35,284 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:29:35,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:29:35,284 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:29:35,284 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:29:35,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:29:35,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:29:35,285 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:29:35,285 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 02:29:35,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:29:35,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:29:35,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:29:35,286 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:29:35,286 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 02:29:35,286 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:29:35,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 02:29:35,287 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 02:29:35,287 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_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-11-10 02:29:35,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:29:35,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:29:35,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:29:35,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:29:35,330 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:29:35,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 02:29:35,373 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data/6eccd0a37/a6adff4ab35d4ec3b38490ccf7ed5af2/FLAG932b90c3c [2018-11-10 02:29:35,723 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:29:35,724 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 02:29:35,731 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data/6eccd0a37/a6adff4ab35d4ec3b38490ccf7ed5af2/FLAG932b90c3c [2018-11-10 02:29:35,743 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data/6eccd0a37/a6adff4ab35d4ec3b38490ccf7ed5af2 [2018-11-10 02:29:35,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:29:35,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:29:35,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:29:35,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:29:35,752 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:29:35,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:35,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc2202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35, skipping insertion in model container [2018-11-10 02:29:35,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:35,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:29:35,783 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:29:35,918 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:29:35,921 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:29:35,945 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:29:35,955 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:29:35,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35 WrapperNode [2018-11-10 02:29:35,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:29:35,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:29:35,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:29:35,956 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:29:35,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:35,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:35,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:29:35,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:29:35,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:29:35,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:29:35,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:35,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:35,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:35,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:35,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:36,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:36,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... [2018-11-10 02:29:36,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:29:36,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:29:36,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:29:36,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:29:36,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:29:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 02:29:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 02:29:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-10 02:29:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-10 02:29:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:29:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:29:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 02:29:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 02:29:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 02:29:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 02:29:36,387 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:29:36,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:29:36 BoogieIcfgContainer [2018-11-10 02:29:36,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:29:36,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 02:29:36,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 02:29:36,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 02:29:36,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:29:35" (1/3) ... [2018-11-10 02:29:36,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429a0841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:29:36, skipping insertion in model container [2018-11-10 02:29:36,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:29:35" (2/3) ... [2018-11-10 02:29:36,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429a0841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:29:36, skipping insertion in model container [2018-11-10 02:29:36,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:29:36" (3/3) ... [2018-11-10 02:29:36,396 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 02:29:36,406 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 02:29:36,415 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 02:29:36,432 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 02:29:36,467 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 02:29:36,467 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 02:29:36,467 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 02:29:36,467 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:29:36,467 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:29:36,467 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 02:29:36,467 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:29:36,468 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 02:29:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-10 02:29:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 02:29:36,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:36,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:36,496 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:36,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash 572437916, now seen corresponding path program 1 times [2018-11-10 02:29:36,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:36,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:36,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:36,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:29:36,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:29:36,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:29:36,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:36,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 02:29:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 02:29:36,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:29:36,655 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-10 02:29:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:36,677 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-11-10 02:29:36,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:29:36,679 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 02:29:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:36,688 INFO L225 Difference]: With dead ends: 79 [2018-11-10 02:29:36,688 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 02:29:36,691 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-11-10 02:29:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 02:29:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 02:29:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 02:29:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-11-10 02:29:36,721 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 21 [2018-11-10 02:29:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:36,721 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-10 02:29:36,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 02:29:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-11-10 02:29:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 02:29:36,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:36,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:36,723 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:36,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash 855921951, now seen corresponding path program 1 times [2018-11-10 02:29:36,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:36,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:36,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:36,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:36,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:29:36,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:29:36,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:29:36,807 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:36,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:29:36,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:29:36,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:29:36,808 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 3 states. [2018-11-10 02:29:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:36,998 INFO L93 Difference]: Finished difference Result 108 states and 175 transitions. [2018-11-10 02:29:36,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:29:36,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 02:29:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:37,000 INFO L225 Difference]: With dead ends: 108 [2018-11-10 02:29:37,000 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 02:29:37,001 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-11-10 02:29:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 02:29:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-10 02:29:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 02:29:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-11-10 02:29:37,011 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 23 [2018-11-10 02:29:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:37,011 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-10 02:29:37,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:29:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2018-11-10 02:29:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 02:29:37,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:37,013 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:37,013 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:37,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1752800542, now seen corresponding path program 1 times [2018-11-10 02:29:37,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:37,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:37,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:29:37,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:29:37,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:29:37,086 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:37,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:29:37,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:29:37,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:29:37,087 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 4 states. [2018-11-10 02:29:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:37,281 INFO L93 Difference]: Finished difference Result 149 states and 236 transitions. [2018-11-10 02:29:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:29:37,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-10 02:29:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:37,284 INFO L225 Difference]: With dead ends: 149 [2018-11-10 02:29:37,284 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 02:29:37,285 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-11-10 02:29:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 02:29:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-11-10 02:29:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 02:29:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2018-11-10 02:29:37,297 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 30 [2018-11-10 02:29:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:37,298 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2018-11-10 02:29:37,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:29:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2018-11-10 02:29:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 02:29:37,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:37,299 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:37,299 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:37,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash -57924349, now seen corresponding path program 1 times [2018-11-10 02:29:37,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:37,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:37,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:29:37,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:29:37,374 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:37,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:29:37,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:29:37,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:29:37,375 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand 4 states. [2018-11-10 02:29:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:37,604 INFO L93 Difference]: Finished difference Result 235 states and 346 transitions. [2018-11-10 02:29:37,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:29:37,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 02:29:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:37,606 INFO L225 Difference]: With dead ends: 235 [2018-11-10 02:29:37,606 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 02:29:37,607 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-11-10 02:29:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 02:29:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2018-11-10 02:29:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 02:29:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2018-11-10 02:29:37,619 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 37 [2018-11-10 02:29:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:37,619 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2018-11-10 02:29:37,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:29:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2018-11-10 02:29:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 02:29:37,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:37,622 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:37,623 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:37,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash -962301442, now seen corresponding path program 1 times [2018-11-10 02:29:37,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:37,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:37,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:37,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:37,625 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 02:29:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:29:37,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:29:37,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:37,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:29:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:29:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:29:37,717 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand 5 states. [2018-11-10 02:29:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:37,899 INFO L93 Difference]: Finished difference Result 372 states and 520 transitions. [2018-11-10 02:29:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:29:37,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 02:29:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:37,903 INFO L225 Difference]: With dead ends: 372 [2018-11-10 02:29:37,904 INFO L226 Difference]: Without dead ends: 259 [2018-11-10 02:29:37,905 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-11-10 02:29:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-10 02:29:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 140. [2018-11-10 02:29:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 02:29:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 195 transitions. [2018-11-10 02:29:37,921 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 195 transitions. Word has length 44 [2018-11-10 02:29:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:37,921 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 195 transitions. [2018-11-10 02:29:37,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:29:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 195 transitions. [2018-11-10 02:29:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 02:29:37,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:37,923 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:37,923 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:37,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1999480767, now seen corresponding path program 1 times [2018-11-10 02:29:37,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:37,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:37,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:37,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:37,927 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 02:29:37,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:29:37,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:29:37,992 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:37,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:29:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:29:37,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:29:37,993 INFO L87 Difference]: Start difference. First operand 140 states and 195 transitions. Second operand 5 states. [2018-11-10 02:29:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:38,163 INFO L93 Difference]: Finished difference Result 380 states and 528 transitions. [2018-11-10 02:29:38,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:29:38,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-10 02:29:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:38,165 INFO L225 Difference]: With dead ends: 380 [2018-11-10 02:29:38,165 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 02:29:38,166 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-11-10 02:29:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 02:29:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 153. [2018-11-10 02:29:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 02:29:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2018-11-10 02:29:38,177 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 45 [2018-11-10 02:29:38,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:38,177 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2018-11-10 02:29:38,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:29:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2018-11-10 02:29:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 02:29:38,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:38,179 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:38,179 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:38,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:38,179 INFO L82 PathProgramCache]: Analyzing trace with hash -379562385, now seen corresponding path program 1 times [2018-11-10 02:29:38,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:38,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:38,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:38,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:38,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:38,271 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-10 02:29:38,273 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-11-10 02:29:38,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:38,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:38,458 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:38,495 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:38,496 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:38,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:38,531 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:38,644 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 81.26% of their original sizes. [2018-11-10 02:29:38,644 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:38,703 INFO L415 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-11-10 02:29:38,703 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:38,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:38,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-10 02:29:38,705 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:38,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 02:29:38,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:29:38,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:29:38,705 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand 7 states. [2018-11-10 02:29:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:40,018 INFO L93 Difference]: Finished difference Result 728 states and 1018 transitions. [2018-11-10 02:29:40,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:29:40,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-10 02:29:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:40,020 INFO L225 Difference]: With dead ends: 728 [2018-11-10 02:29:40,020 INFO L226 Difference]: Without dead ends: 615 [2018-11-10 02:29:40,021 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:29:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-10 02:29:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 156. [2018-11-10 02:29:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 02:29:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2018-11-10 02:29:40,034 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 46 [2018-11-10 02:29:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:40,035 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2018-11-10 02:29:40,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 02:29:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2018-11-10 02:29:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 02:29:40,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:40,036 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:40,036 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:40,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:40,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1491700643, now seen corresponding path program 1 times [2018-11-10 02:29:40,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:40,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:40,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:40,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:40,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:40,087 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-10 02:29:40,088 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-11-10 02:29:40,089 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:40,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:40,099 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:40,106 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:40,107 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:40,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:40,109 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:40,139 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 83.17% of their original sizes. [2018-11-10 02:29:40,139 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:40,196 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-10 02:29:40,196 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:40,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:40,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 02:29:40,196 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:40,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:29:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:29:40,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:40,197 INFO L87 Difference]: Start difference. First operand 156 states and 214 transitions. Second operand 9 states. [2018-11-10 02:29:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:40,788 INFO L93 Difference]: Finished difference Result 857 states and 1198 transitions. [2018-11-10 02:29:40,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:29:40,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-10 02:29:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:40,791 INFO L225 Difference]: With dead ends: 857 [2018-11-10 02:29:40,791 INFO L226 Difference]: Without dead ends: 744 [2018-11-10 02:29:40,792 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-11-10 02:29:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-11-10 02:29:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 156. [2018-11-10 02:29:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 02:29:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2018-11-10 02:29:40,801 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 47 [2018-11-10 02:29:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:40,802 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2018-11-10 02:29:40,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:29:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2018-11-10 02:29:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 02:29:40,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:40,803 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:40,803 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:40,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:40,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1773907355, now seen corresponding path program 1 times [2018-11-10 02:29:40,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:40,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:40,805 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:40,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:40,864 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:40,864 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-10 02:29:40,864 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-11-10 02:29:40,865 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:40,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:40,873 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:40,878 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:40,878 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:40,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:40,881 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:40,906 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 83.17% of their original sizes. [2018-11-10 02:29:40,906 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:40,948 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-10 02:29:40,948 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-10 02:29:40,949 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:40,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:29:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:29:40,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:29:40,951 INFO L87 Difference]: Start difference. First operand 156 states and 214 transitions. Second operand 8 states. [2018-11-10 02:29:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:41,805 INFO L93 Difference]: Finished difference Result 861 states and 1202 transitions. [2018-11-10 02:29:41,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:29:41,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-10 02:29:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:41,807 INFO L225 Difference]: With dead ends: 861 [2018-11-10 02:29:41,807 INFO L226 Difference]: Without dead ends: 748 [2018-11-10 02:29:41,807 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:29:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-10 02:29:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 153. [2018-11-10 02:29:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 02:29:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2018-11-10 02:29:41,816 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 47 [2018-11-10 02:29:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:41,817 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2018-11-10 02:29:41,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:29:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2018-11-10 02:29:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 02:29:41,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:41,818 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:41,818 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:41,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1372696950, now seen corresponding path program 1 times [2018-11-10 02:29:41,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:41,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:41,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:41,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:41,819 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:41,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:41,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:41,872 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-10 02:29:41,872 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-11-10 02:29:41,873 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:41,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:41,881 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:41,885 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:41,885 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:41,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:41,887 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:41,907 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 82.06% of their original sizes. [2018-11-10 02:29:41,907 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:41,957 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-10 02:29:41,957 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:41,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:41,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 02:29:41,957 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:41,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:29:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:29:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:41,958 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand 9 states. [2018-11-10 02:29:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:42,868 INFO L93 Difference]: Finished difference Result 845 states and 1180 transitions. [2018-11-10 02:29:42,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:29:42,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-10 02:29:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:42,872 INFO L225 Difference]: With dead ends: 845 [2018-11-10 02:29:42,872 INFO L226 Difference]: Without dead ends: 732 [2018-11-10 02:29:42,872 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-11-10 02:29:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 157. [2018-11-10 02:29:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 02:29:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2018-11-10 02:29:42,890 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 47 [2018-11-10 02:29:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:42,890 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2018-11-10 02:29:42,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:29:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2018-11-10 02:29:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 02:29:42,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:42,891 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:42,891 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:42,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash 528691448, now seen corresponding path program 1 times [2018-11-10 02:29:42,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:42,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:42,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:42,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:42,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:42,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:42,996 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-10 02:29:42,996 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-11-10 02:29:42,998 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:42,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:43,008 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:43,016 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:43,016 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:43,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:43,018 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:43,050 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 82.06% of their original sizes. [2018-11-10 02:29:43,051 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:43,101 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-10 02:29:43,101 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:43,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:43,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-10 02:29:43,102 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:43,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:29:43,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:29:43,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:29:43,102 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand 8 states. [2018-11-10 02:29:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:43,684 INFO L93 Difference]: Finished difference Result 846 states and 1179 transitions. [2018-11-10 02:29:43,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:29:43,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-10 02:29:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:43,687 INFO L225 Difference]: With dead ends: 846 [2018-11-10 02:29:43,687 INFO L226 Difference]: Without dead ends: 733 [2018-11-10 02:29:43,688 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-11-10 02:29:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-10 02:29:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 157. [2018-11-10 02:29:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 02:29:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2018-11-10 02:29:43,697 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 47 [2018-11-10 02:29:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:43,698 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2018-11-10 02:29:43,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:29:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2018-11-10 02:29:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 02:29:43,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:43,699 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:43,699 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:43,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1256149320, now seen corresponding path program 1 times [2018-11-10 02:29:43,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:43,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:43,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:43,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:43,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:43,747 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-10 02:29:43,747 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-11-10 02:29:43,748 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:43,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:43,754 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:43,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:43,759 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:43,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:43,760 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:43,778 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.76% of their original sizes. [2018-11-10 02:29:43,778 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:43,833 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-10 02:29:43,833 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:43,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:43,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-10 02:29:43,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:43,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 02:29:43,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 02:29:43,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:29:43,836 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand 11 states. [2018-11-10 02:29:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:44,550 INFO L93 Difference]: Finished difference Result 966 states and 1350 transitions. [2018-11-10 02:29:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:29:44,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-11-10 02:29:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:44,552 INFO L225 Difference]: With dead ends: 966 [2018-11-10 02:29:44,552 INFO L226 Difference]: Without dead ends: 853 [2018-11-10 02:29:44,553 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-11-10 02:29:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-10 02:29:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 161. [2018-11-10 02:29:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-10 02:29:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2018-11-10 02:29:44,563 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 48 [2018-11-10 02:29:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:44,563 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2018-11-10 02:29:44,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 02:29:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2018-11-10 02:29:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 02:29:44,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:44,564 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:44,564 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:44,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:44,564 INFO L82 PathProgramCache]: Analyzing trace with hash 412143818, now seen corresponding path program 1 times [2018-11-10 02:29:44,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:44,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:44,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:44,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:44,603 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:44,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-10 02:29:44,604 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-11-10 02:29:44,605 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:44,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:44,610 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:44,614 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:44,614 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:44,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:44,621 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:44,639 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.76% of their original sizes. [2018-11-10 02:29:44,639 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:44,687 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-10 02:29:44,687 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:44,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:44,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 02:29:44,688 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:44,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 02:29:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:29:44,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:29:44,688 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand 10 states. [2018-11-10 02:29:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:45,257 INFO L93 Difference]: Finished difference Result 967 states and 1349 transitions. [2018-11-10 02:29:45,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:29:45,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-10 02:29:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:45,259 INFO L225 Difference]: With dead ends: 967 [2018-11-10 02:29:45,259 INFO L226 Difference]: Without dead ends: 854 [2018-11-10 02:29:45,259 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:29:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-10 02:29:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 157. [2018-11-10 02:29:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 02:29:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2018-11-10 02:29:45,269 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 48 [2018-11-10 02:29:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:45,269 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2018-11-10 02:29:45,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 02:29:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2018-11-10 02:29:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 02:29:45,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:45,270 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:45,270 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:45,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash -589217846, now seen corresponding path program 1 times [2018-11-10 02:29:45,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:45,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:45,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:45,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:45,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:45,302 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-10 02:29:45,302 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-11-10 02:29:45,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:45,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:45,308 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:45,313 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:45,313 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:45,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:45,314 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:45,330 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.76% of their original sizes. [2018-11-10 02:29:45,330 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:45,374 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-10 02:29:45,374 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 02:29:45,374 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:45,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 02:29:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:29:45,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:29:45,375 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand 10 states. [2018-11-10 02:29:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:45,973 INFO L93 Difference]: Finished difference Result 958 states and 1340 transitions. [2018-11-10 02:29:45,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:29:45,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-10 02:29:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:45,975 INFO L225 Difference]: With dead ends: 958 [2018-11-10 02:29:45,975 INFO L226 Difference]: Without dead ends: 845 [2018-11-10 02:29:45,976 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-11-10 02:29:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-11-10 02:29:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 157. [2018-11-10 02:29:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 02:29:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2018-11-10 02:29:45,986 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 48 [2018-11-10 02:29:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:45,986 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2018-11-10 02:29:45,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 02:29:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2018-11-10 02:29:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 02:29:45,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:45,987 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:45,987 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:45,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:45,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1433223348, now seen corresponding path program 1 times [2018-11-10 02:29:45,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:45,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:45,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:29:46,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:46,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:46,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-10 02:29:46,019 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-11-10 02:29:46,020 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:46,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:46,027 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:46,033 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:46,033 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:46,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:46,034 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:46,057 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.76% of their original sizes. [2018-11-10 02:29:46,057 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:46,102 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-10 02:29:46,102 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:46,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:46,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 02:29:46,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:46,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:29:46,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:29:46,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:46,104 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand 9 states. [2018-11-10 02:29:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:46,577 INFO L93 Difference]: Finished difference Result 959 states and 1339 transitions. [2018-11-10 02:29:46,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:29:46,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-11-10 02:29:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:46,579 INFO L225 Difference]: With dead ends: 959 [2018-11-10 02:29:46,579 INFO L226 Difference]: Without dead ends: 846 [2018-11-10 02:29:46,580 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-11-10 02:29:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 146. [2018-11-10 02:29:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 02:29:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2018-11-10 02:29:46,590 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 48 [2018-11-10 02:29:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:46,590 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2018-11-10 02:29:46,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:29:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2018-11-10 02:29:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 02:29:46,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:46,591 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:46,591 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:46,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash -516694075, now seen corresponding path program 1 times [2018-11-10 02:29:46,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:46,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:46,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:46,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:46,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 02:29:46,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:29:46,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:29:46,619 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:46,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:29:46,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:29:46,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:29:46,620 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 3 states. [2018-11-10 02:29:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:46,644 INFO L93 Difference]: Finished difference Result 206 states and 277 transitions. [2018-11-10 02:29:46,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:29:46,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-10 02:29:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:46,646 INFO L225 Difference]: With dead ends: 206 [2018-11-10 02:29:46,646 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 02:29:46,646 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-11-10 02:29:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 02:29:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-11-10 02:29:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 02:29:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2018-11-10 02:29:46,656 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 52 [2018-11-10 02:29:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:46,656 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2018-11-10 02:29:46,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:29:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2018-11-10 02:29:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 02:29:46,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:46,657 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:46,657 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:46,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:46,657 INFO L82 PathProgramCache]: Analyzing trace with hash -241934461, now seen corresponding path program 1 times [2018-11-10 02:29:46,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:46,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:46,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:46,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:46,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:46,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:46,728 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:46,728 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-10 02:29:46,728 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-11-10 02:29:46,729 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:46,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:46,734 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:46,740 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:46,740 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:46,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:46,742 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:46,771 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 71.7% of their original sizes. [2018-11-10 02:29:46,772 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:46,825 INFO L415 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-11-10 02:29:46,825 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:46,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:46,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-11-10 02:29:46,826 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:46,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:29:46,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:29:46,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:29:46,826 INFO L87 Difference]: Start difference. First operand 173 states and 235 transitions. Second operand 8 states. [2018-11-10 02:29:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:47,352 INFO L93 Difference]: Finished difference Result 731 states and 1006 transitions. [2018-11-10 02:29:47,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:29:47,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-10 02:29:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:47,354 INFO L225 Difference]: With dead ends: 731 [2018-11-10 02:29:47,354 INFO L226 Difference]: Without dead ends: 594 [2018-11-10 02:29:47,355 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:29:47,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-10 02:29:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 173. [2018-11-10 02:29:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 02:29:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2018-11-10 02:29:47,367 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 52 [2018-11-10 02:29:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:47,367 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2018-11-10 02:29:47,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:29:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2018-11-10 02:29:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 02:29:47,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:47,368 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:47,368 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:47,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash -320718692, now seen corresponding path program 1 times [2018-11-10 02:29:47,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:47,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:47,369 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:47,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:47,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:47,402 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-10 02:29:47,402 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-11-10 02:29:47,403 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:47,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:47,408 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:47,412 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:47,412 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:47,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:47,413 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:47,433 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 76.51% of their original sizes. [2018-11-10 02:29:47,433 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:47,460 INFO L415 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-11-10 02:29:47,460 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:47,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:47,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-10 02:29:47,460 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:47,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 02:29:47,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:29:47,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:29:47,461 INFO L87 Difference]: Start difference. First operand 173 states and 235 transitions. Second operand 7 states. [2018-11-10 02:29:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:47,714 INFO L93 Difference]: Finished difference Result 745 states and 1023 transitions. [2018-11-10 02:29:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:29:47,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-10 02:29:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:47,716 INFO L225 Difference]: With dead ends: 745 [2018-11-10 02:29:47,716 INFO L226 Difference]: Without dead ends: 607 [2018-11-10 02:29:47,716 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:29:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-10 02:29:47,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 175. [2018-11-10 02:29:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 02:29:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 238 transitions. [2018-11-10 02:29:47,729 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 238 transitions. Word has length 52 [2018-11-10 02:29:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:47,730 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 238 transitions. [2018-11-10 02:29:47,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 02:29:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 238 transitions. [2018-11-10 02:29:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 02:29:47,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:47,730 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:47,730 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:47,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:47,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2107792578, now seen corresponding path program 1 times [2018-11-10 02:29:47,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:47,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:47,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:47,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:47,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:47,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:47,778 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:47,778 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 02:29:47,778 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-11-10 02:29:47,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:47,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:47,784 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:47,790 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:47,790 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:47,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:47,792 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:47,817 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 73.87% of their original sizes. [2018-11-10 02:29:47,817 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:47,883 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-10 02:29:47,883 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:47,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:47,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 02:29:47,884 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:47,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 02:29:47,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:29:47,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:29:47,885 INFO L87 Difference]: Start difference. First operand 175 states and 238 transitions. Second operand 10 states. [2018-11-10 02:29:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:48,388 INFO L93 Difference]: Finished difference Result 873 states and 1202 transitions. [2018-11-10 02:29:48,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:29:48,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-11-10 02:29:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:48,390 INFO L225 Difference]: With dead ends: 873 [2018-11-10 02:29:48,390 INFO L226 Difference]: Without dead ends: 736 [2018-11-10 02:29:48,391 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:29:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-11-10 02:29:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 175. [2018-11-10 02:29:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 02:29:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 238 transitions. [2018-11-10 02:29:48,407 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 238 transitions. Word has length 53 [2018-11-10 02:29:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:48,407 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 238 transitions. [2018-11-10 02:29:48,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 02:29:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 238 transitions. [2018-11-10 02:29:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 02:29:48,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:48,408 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:48,408 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:48,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1939028224, now seen corresponding path program 1 times [2018-11-10 02:29:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:48,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:48,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:48,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:48,460 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:48,460 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 02:29:48,461 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-11-10 02:29:48,462 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:48,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:48,468 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:48,477 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:48,477 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:48,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:48,479 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:48,526 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 73.87% of their original sizes. [2018-11-10 02:29:48,526 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:48,601 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-10 02:29:48,601 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:48,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 02:29:48,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:48,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:29:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:29:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:48,602 INFO L87 Difference]: Start difference. First operand 175 states and 238 transitions. Second operand 9 states. [2018-11-10 02:29:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:49,210 INFO L93 Difference]: Finished difference Result 877 states and 1206 transitions. [2018-11-10 02:29:49,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:29:49,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-11-10 02:29:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:49,212 INFO L225 Difference]: With dead ends: 877 [2018-11-10 02:29:49,213 INFO L226 Difference]: Without dead ends: 740 [2018-11-10 02:29:49,213 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-11-10 02:29:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 166. [2018-11-10 02:29:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 02:29:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2018-11-10 02:29:49,229 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 53 [2018-11-10 02:29:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:49,229 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2018-11-10 02:29:49,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:29:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2018-11-10 02:29:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 02:29:49,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:49,230 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:49,230 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:49,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:49,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1289333770, now seen corresponding path program 1 times [2018-11-10 02:29:49,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:49,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:49,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:49,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:49,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:49,286 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 02:29:49,286 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-11-10 02:29:49,287 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:49,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:49,293 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:49,297 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:49,298 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:49,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:49,299 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:49,318 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 79.06% of their original sizes. [2018-11-10 02:29:49,318 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:49,358 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-10 02:29:49,358 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:49,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:49,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 02:29:49,359 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:49,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:29:49,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:29:49,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:49,359 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand 9 states. [2018-11-10 02:29:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:50,084 INFO L93 Difference]: Finished difference Result 884 states and 1218 transitions. [2018-11-10 02:29:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:29:50,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-11-10 02:29:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:50,086 INFO L225 Difference]: With dead ends: 884 [2018-11-10 02:29:50,086 INFO L226 Difference]: Without dead ends: 746 [2018-11-10 02:29:50,087 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-11-10 02:29:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-10 02:29:50,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 166. [2018-11-10 02:29:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 02:29:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2018-11-10 02:29:50,103 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 53 [2018-11-10 02:29:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:50,103 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2018-11-10 02:29:50,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:29:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2018-11-10 02:29:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 02:29:50,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:50,104 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:50,104 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:50,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash -760054072, now seen corresponding path program 1 times [2018-11-10 02:29:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:50,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:50,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:50,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:50,105 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:50,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:50,146 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:50,146 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 02:29:50,146 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-11-10 02:29:50,147 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:50,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:50,152 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:50,156 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:50,156 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 02:29:50,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:50,158 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:50,178 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 79.06% of their original sizes. [2018-11-10 02:29:50,178 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:50,215 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-10 02:29:50,215 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:50,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:50,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-10 02:29:50,215 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:50,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:29:50,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:29:50,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:29:50,216 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand 8 states. [2018-11-10 02:29:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:50,807 INFO L93 Difference]: Finished difference Result 880 states and 1213 transitions. [2018-11-10 02:29:50,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:29:50,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-10 02:29:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:50,810 INFO L225 Difference]: With dead ends: 880 [2018-11-10 02:29:50,810 INFO L226 Difference]: Without dead ends: 742 [2018-11-10 02:29:50,810 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-11-10 02:29:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-11-10 02:29:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 160. [2018-11-10 02:29:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-10 02:29:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 218 transitions. [2018-11-10 02:29:50,827 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 218 transitions. Word has length 53 [2018-11-10 02:29:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:50,827 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 218 transitions. [2018-11-10 02:29:50,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:29:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2018-11-10 02:29:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 02:29:50,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:50,828 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-11-10 02:29:50,828 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:50,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:50,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1327729205, now seen corresponding path program 1 times [2018-11-10 02:29:50,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:50,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:50,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:50,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:50,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:50,872 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 02:29:50,873 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-11-10 02:29:50,873 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:50,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:50,879 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:50,896 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:50,897 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-11-10 02:29:50,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:50,901 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:50,949 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 68.6% of their original sizes. [2018-11-10 02:29:50,949 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:51,038 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-10 02:29:51,038 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:51,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:51,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 02:29:51,039 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:51,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:29:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:29:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:29:51,039 INFO L87 Difference]: Start difference. First operand 160 states and 218 transitions. Second operand 9 states. [2018-11-10 02:29:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:51,484 INFO L93 Difference]: Finished difference Result 609 states and 833 transitions. [2018-11-10 02:29:51,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:29:51,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-10 02:29:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:51,487 INFO L225 Difference]: With dead ends: 609 [2018-11-10 02:29:51,487 INFO L226 Difference]: Without dead ends: 472 [2018-11-10 02:29:51,487 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:29:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-11-10 02:29:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 189. [2018-11-10 02:29:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 02:29:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 249 transitions. [2018-11-10 02:29:51,504 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 249 transitions. Word has length 55 [2018-11-10 02:29:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:51,504 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 249 transitions. [2018-11-10 02:29:51,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:29:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 249 transitions. [2018-11-10 02:29:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 02:29:51,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:51,505 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-11-10 02:29:51,505 INFO L424 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:51,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1390119177, now seen corresponding path program 1 times [2018-11-10 02:29:51,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:51,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:51,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:51,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:51,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:51,595 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 02:29:51,595 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-11-10 02:29:51,596 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:51,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:51,601 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:51,617 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:51,617 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-11-10 02:29:51,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:51,619 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:51,658 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 71.03% of their original sizes. [2018-11-10 02:29:51,658 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:51,754 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 02:29:51,754 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:51,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:51,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-10 02:29:51,754 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:51,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 02:29:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:29:51,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:29:51,755 INFO L87 Difference]: Start difference. First operand 189 states and 249 transitions. Second operand 10 states. [2018-11-10 02:29:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:52,554 INFO L93 Difference]: Finished difference Result 767 states and 1045 transitions. [2018-11-10 02:29:52,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:29:52,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-10 02:29:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:52,556 INFO L225 Difference]: With dead ends: 767 [2018-11-10 02:29:52,556 INFO L226 Difference]: Without dead ends: 630 [2018-11-10 02:29:52,557 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:29:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-11-10 02:29:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 190. [2018-11-10 02:29:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-10 02:29:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 251 transitions. [2018-11-10 02:29:52,577 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 251 transitions. Word has length 56 [2018-11-10 02:29:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:52,577 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 251 transitions. [2018-11-10 02:29:52,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 02:29:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 251 transitions. [2018-11-10 02:29:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 02:29:52,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:52,578 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-11-10 02:29:52,578 INFO L424 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:52,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1587615656, now seen corresponding path program 1 times [2018-11-10 02:29:52,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:52,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:52,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:52,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:52,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:52,631 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 02:29:52,631 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-11-10 02:29:52,632 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:52,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:52,637 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:52,655 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:52,655 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-11-10 02:29:52,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:52,657 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:52,717 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 71.47% of their original sizes. [2018-11-10 02:29:52,718 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:52,825 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 02:29:52,825 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:52,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:52,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 02:29:52,826 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:52,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 02:29:52,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:29:52,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:29:52,826 INFO L87 Difference]: Start difference. First operand 190 states and 251 transitions. Second operand 10 states. [2018-11-10 02:29:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:53,931 INFO L93 Difference]: Finished difference Result 780 states and 1061 transitions. [2018-11-10 02:29:53,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:29:53,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-10 02:29:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:53,933 INFO L225 Difference]: With dead ends: 780 [2018-11-10 02:29:53,933 INFO L226 Difference]: Without dead ends: 643 [2018-11-10 02:29:53,934 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:29:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-10 02:29:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 192. [2018-11-10 02:29:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-10 02:29:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 254 transitions. [2018-11-10 02:29:53,956 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 254 transitions. Word has length 56 [2018-11-10 02:29:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:53,956 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 254 transitions. [2018-11-10 02:29:53,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 02:29:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 254 transitions. [2018-11-10 02:29:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 02:29:53,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:53,957 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:53,958 INFO L424 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:53,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1533263030, now seen corresponding path program 1 times [2018-11-10 02:29:53,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:53,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:53,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:54,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:54,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:54,003 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 02:29:54,004 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-11-10 02:29:54,005 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:54,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:54,009 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:54,026 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:54,026 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-11-10 02:29:54,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:54,028 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:54,066 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.09% of their original sizes. [2018-11-10 02:29:54,066 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:54,201 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 02:29:54,201 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-10 02:29:54,202 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:54,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 02:29:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 02:29:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:29:54,202 INFO L87 Difference]: Start difference. First operand 192 states and 254 transitions. Second operand 12 states. [2018-11-10 02:29:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:55,317 INFO L93 Difference]: Finished difference Result 951 states and 1285 transitions. [2018-11-10 02:29:55,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 02:29:55,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-10 02:29:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:55,319 INFO L225 Difference]: With dead ends: 951 [2018-11-10 02:29:55,319 INFO L226 Difference]: Without dead ends: 813 [2018-11-10 02:29:55,320 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-11-10 02:29:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-11-10 02:29:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 220. [2018-11-10 02:29:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-10 02:29:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 284 transitions. [2018-11-10 02:29:55,341 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 284 transitions. Word has length 57 [2018-11-10 02:29:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:55,341 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 284 transitions. [2018-11-10 02:29:55,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 02:29:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 284 transitions. [2018-11-10 02:29:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 02:29:55,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:55,342 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:55,343 INFO L424 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:55,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash -833431564, now seen corresponding path program 1 times [2018-11-10 02:29:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:55,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:55,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:55,344 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:55,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:55,406 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:55,406 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 02:29:55,406 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-11-10 02:29:55,407 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:55,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:55,412 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:55,427 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:55,427 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-11-10 02:29:55,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:55,428 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:55,466 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.09% of their original sizes. [2018-11-10 02:29:55,466 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:55,580 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 02:29:55,580 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:55,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:55,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-10 02:29:55,580 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:55,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 02:29:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 02:29:55,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:29:55,581 INFO L87 Difference]: Start difference. First operand 220 states and 284 transitions. Second operand 11 states. [2018-11-10 02:29:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:56,797 INFO L93 Difference]: Finished difference Result 972 states and 1307 transitions. [2018-11-10 02:29:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 02:29:56,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-10 02:29:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:56,800 INFO L225 Difference]: With dead ends: 972 [2018-11-10 02:29:56,800 INFO L226 Difference]: Without dead ends: 835 [2018-11-10 02:29:56,800 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-11-10 02:29:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-10 02:29:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 220. [2018-11-10 02:29:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-10 02:29:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 284 transitions. [2018-11-10 02:29:56,822 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 284 transitions. Word has length 57 [2018-11-10 02:29:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:56,823 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 284 transitions. [2018-11-10 02:29:56,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 02:29:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 284 transitions. [2018-11-10 02:29:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 02:29:56,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:56,824 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:56,824 INFO L424 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:56,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:56,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1169499158, now seen corresponding path program 1 times [2018-11-10 02:29:56,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:56,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:56,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:56,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:56,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:56,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:56,860 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 02:29:56,860 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-11-10 02:29:56,861 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:56,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:56,866 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:56,880 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:56,880 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-11-10 02:29:56,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:56,885 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:56,925 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.82% of their original sizes. [2018-11-10 02:29:56,925 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:57,062 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 02:29:57,062 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:57,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-11-10 02:29:57,063 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:57,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 02:29:57,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 02:29:57,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:29:57,064 INFO L87 Difference]: Start difference. First operand 220 states and 284 transitions. Second operand 13 states. [2018-11-10 02:29:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:58,174 INFO L93 Difference]: Finished difference Result 966 states and 1305 transitions. [2018-11-10 02:29:58,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 02:29:58,174 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-10 02:29:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:58,177 INFO L225 Difference]: With dead ends: 966 [2018-11-10 02:29:58,178 INFO L226 Difference]: Without dead ends: 828 [2018-11-10 02:29:58,179 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-11-10 02:29:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-11-10 02:29:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 244. [2018-11-10 02:29:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-10 02:29:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 310 transitions. [2018-11-10 02:29:58,238 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 310 transitions. Word has length 57 [2018-11-10 02:29:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:58,238 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 310 transitions. [2018-11-10 02:29:58,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 02:29:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 310 transitions. [2018-11-10 02:29:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 02:29:58,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:58,239 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:58,239 INFO L424 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:58,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1186306092, now seen corresponding path program 1 times [2018-11-10 02:29:58,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:58,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:58,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:58,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:29:58,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:58,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:58,295 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 02:29:58,295 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-11-10 02:29:58,296 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:58,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:58,304 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:58,322 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:58,323 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-11-10 02:29:58,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:58,329 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:58,373 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.9% of their original sizes. [2018-11-10 02:29:58,373 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:29:58,507 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 02:29:58,507 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:29:58,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:29:58,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-10 02:29:58,508 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:29:58,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 02:29:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 02:29:58,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:29:58,508 INFO L87 Difference]: Start difference. First operand 244 states and 310 transitions. Second operand 11 states. [2018-11-10 02:29:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:29:59,667 INFO L93 Difference]: Finished difference Result 992 states and 1332 transitions. [2018-11-10 02:29:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 02:29:59,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-10 02:29:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:29:59,669 INFO L225 Difference]: With dead ends: 992 [2018-11-10 02:29:59,669 INFO L226 Difference]: Without dead ends: 855 [2018-11-10 02:29:59,670 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-11-10 02:29:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-11-10 02:29:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 242. [2018-11-10 02:29:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-10 02:29:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 307 transitions. [2018-11-10 02:29:59,713 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 307 transitions. Word has length 57 [2018-11-10 02:29:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:29:59,713 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 307 transitions. [2018-11-10 02:29:59,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 02:29:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 307 transitions. [2018-11-10 02:29:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 02:29:59,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:29:59,714 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:29:59,714 INFO L424 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:29:59,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1208741702, now seen corresponding path program 1 times [2018-11-10 02:29:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:29:59,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:59,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:29:59,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:29:59,715 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:29:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:29:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 02:29:59,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:29:59,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:29:59,766 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 02:29:59,766 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-11-10 02:29:59,767 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:29:59,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:29:59,774 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:29:59,801 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:29:59,801 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-11-10 02:29:59,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:29:59,803 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:29:59,867 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 73.52% of their original sizes. [2018-11-10 02:29:59,867 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:30:00,060 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 02:30:00,061 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:30:00,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:30:00,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-10 02:30:00,061 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:30:00,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 02:30:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 02:30:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:30:00,062 INFO L87 Difference]: Start difference. First operand 242 states and 307 transitions. Second operand 11 states. [2018-11-10 02:30:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:01,087 INFO L93 Difference]: Finished difference Result 1007 states and 1346 transitions. [2018-11-10 02:30:01,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 02:30:01,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-10 02:30:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:01,089 INFO L225 Difference]: With dead ends: 1007 [2018-11-10 02:30:01,090 INFO L226 Difference]: Without dead ends: 870 [2018-11-10 02:30:01,090 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:30:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-11-10 02:30:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 245. [2018-11-10 02:30:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-10 02:30:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 312 transitions. [2018-11-10 02:30:01,121 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 312 transitions. Word has length 57 [2018-11-10 02:30:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:01,121 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 312 transitions. [2018-11-10 02:30:01,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 02:30:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 312 transitions. [2018-11-10 02:30:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 02:30:01,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:01,122 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:01,122 INFO L424 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:01,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -131033476, now seen corresponding path program 1 times [2018-11-10 02:30:01,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:30:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:01,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:01,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:30:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 02:30:01,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:01,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:30:01,200 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-10 02:30:01,201 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-11-10 02:30:01,202 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:30:01,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:30:01,208 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:30:02,452 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 02:30:02,452 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-11-10 02:30:02,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:02,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 02:30:02,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:02,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:30:02,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:02,474 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 02:30:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:02,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 02:30:02,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:30:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 02:30:02,701 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:30:02,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-11-10 02:30:02,701 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:30:02,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:30:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:30:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:30:02,702 INFO L87 Difference]: Start difference. First operand 245 states and 312 transitions. Second operand 4 states. [2018-11-10 02:30:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:03,459 INFO L93 Difference]: Finished difference Result 444 states and 612 transitions. [2018-11-10 02:30:03,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:30:03,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-10 02:30:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:03,461 INFO L225 Difference]: With dead ends: 444 [2018-11-10 02:30:03,462 INFO L226 Difference]: Without dead ends: 307 [2018-11-10 02:30:03,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:30:03,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-10 02:30:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 288. [2018-11-10 02:30:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-10 02:30:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 361 transitions. [2018-11-10 02:30:03,529 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 361 transitions. Word has length 58 [2018-11-10 02:30:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:03,529 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 361 transitions. [2018-11-10 02:30:03,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:30:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 361 transitions. [2018-11-10 02:30:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 02:30:03,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:03,530 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-11-10 02:30:03,530 INFO L424 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:03,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1985992873, now seen corresponding path program 1 times [2018-11-10 02:30:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:30:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:03,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:03,531 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:30:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 02:30:03,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:03,665 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:30:03,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 02:30:03,666 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-11-10 02:30:03,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:30:03,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:30:03,675 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:30:05,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 02:30:05,440 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-11-10 02:30:05,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:05,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 02:30:05,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:05,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:30:05,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:05,465 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 02:30:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:05,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 02:30:05,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:30:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 02:30:05,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 02:30:05,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 11 [2018-11-10 02:30:05,715 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 02:30:05,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 02:30:05,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:30:05,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:30:05,716 INFO L87 Difference]: Start difference. First operand 288 states and 361 transitions. Second operand 7 states. [2018-11-10 02:30:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:06,214 INFO L93 Difference]: Finished difference Result 769 states and 997 transitions. [2018-11-10 02:30:06,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:30:06,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2018-11-10 02:30:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:06,219 INFO L225 Difference]: With dead ends: 769 [2018-11-10 02:30:06,219 INFO L226 Difference]: Without dead ends: 557 [2018-11-10 02:30:06,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:30:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-11-10 02:30:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 441. [2018-11-10 02:30:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-11-10 02:30:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 555 transitions. [2018-11-10 02:30:06,331 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 555 transitions. Word has length 65 [2018-11-10 02:30:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:06,331 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 555 transitions. [2018-11-10 02:30:06,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 02:30:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 555 transitions. [2018-11-10 02:30:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 02:30:06,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:06,333 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-11-10 02:30:06,333 INFO L424 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:06,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash -86525159, now seen corresponding path program 1 times [2018-11-10 02:30:06,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:30:06,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:06,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:06,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:06,335 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:30:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 02:30:06,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:06,486 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:30:06,486 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 02:30:06,486 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-11-10 02:30:06,487 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:30:06,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:30:06,495 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:30:06,521 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:30:06,522 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-11-10 02:30:06,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:06,525 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:30:06,599 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 75.57% of their original sizes. [2018-11-10 02:30:06,599 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:30:06,894 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 02:30:06,895 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:30:06,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:30:06,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-10 02:30:06,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:30:06,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 02:30:06,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 02:30:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-10 02:30:06,896 INFO L87 Difference]: Start difference. First operand 441 states and 555 transitions. Second operand 14 states. [2018-11-10 02:30:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:08,245 INFO L93 Difference]: Finished difference Result 1403 states and 1820 transitions. [2018-11-10 02:30:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 02:30:08,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-10 02:30:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:08,248 INFO L225 Difference]: With dead ends: 1403 [2018-11-10 02:30:08,249 INFO L226 Difference]: Without dead ends: 1222 [2018-11-10 02:30:08,250 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-11-10 02:30:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2018-11-10 02:30:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 442. [2018-11-10 02:30:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-10 02:30:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2018-11-10 02:30:08,346 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 65 [2018-11-10 02:30:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:08,347 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2018-11-10 02:30:08,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 02:30:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2018-11-10 02:30:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 02:30:08,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:08,348 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-11-10 02:30:08,348 INFO L424 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:08,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash -45850409, now seen corresponding path program 1 times [2018-11-10 02:30:08,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:30:08,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:08,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:08,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:30:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 02:30:08,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:08,470 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:30:08,470 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 02:30:08,470 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-11-10 02:30:08,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:30:08,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:30:08,483 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:30:08,517 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:30:08,517 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-11-10 02:30:08,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:08,537 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:30:08,632 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 75.64% of their original sizes. [2018-11-10 02:30:08,632 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:30:08,842 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 02:30:08,842 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:30:08,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:30:08,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-11-10 02:30:08,843 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:30:08,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 02:30:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 02:30:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:30:08,843 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 12 states. [2018-11-10 02:30:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:10,577 INFO L93 Difference]: Finished difference Result 1406 states and 1823 transitions. [2018-11-10 02:30:10,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 02:30:10,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-10 02:30:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:10,579 INFO L225 Difference]: With dead ends: 1406 [2018-11-10 02:30:10,579 INFO L226 Difference]: Without dead ends: 1226 [2018-11-10 02:30:10,580 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:30:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2018-11-10 02:30:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 439. [2018-11-10 02:30:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-11-10 02:30:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 552 transitions. [2018-11-10 02:30:10,672 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 552 transitions. Word has length 65 [2018-11-10 02:30:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:10,672 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 552 transitions. [2018-11-10 02:30:10,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 02:30:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 552 transitions. [2018-11-10 02:30:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 02:30:10,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:10,677 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-11-10 02:30:10,677 INFO L424 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:10,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1002521586, now seen corresponding path program 1 times [2018-11-10 02:30:10,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:30:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:10,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:10,679 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:30:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 02:30:10,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:10,782 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:30:10,782 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 02:30:10,782 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-11-10 02:30:10,783 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:30:10,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:30:10,790 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:30:10,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:30:10,820 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-11-10 02:30:10,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:10,826 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:30:10,896 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 75.27% of their original sizes. [2018-11-10 02:30:10,896 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:30:11,139 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 02:30:11,140 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:30:11,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:30:11,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2018-11-10 02:30:11,140 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:30:11,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 02:30:11,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 02:30:11,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:30:11,140 INFO L87 Difference]: Start difference. First operand 439 states and 552 transitions. Second operand 13 states. [2018-11-10 02:30:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:12,438 INFO L93 Difference]: Finished difference Result 1419 states and 1836 transitions. [2018-11-10 02:30:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 02:30:12,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-10 02:30:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:12,440 INFO L225 Difference]: With dead ends: 1419 [2018-11-10 02:30:12,441 INFO L226 Difference]: Without dead ends: 1238 [2018-11-10 02:30:12,441 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-10 02:30:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-11-10 02:30:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 470. [2018-11-10 02:30:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-11-10 02:30:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 587 transitions. [2018-11-10 02:30:12,534 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 587 transitions. Word has length 65 [2018-11-10 02:30:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:12,534 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 587 transitions. [2018-11-10 02:30:12,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 02:30:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 587 transitions. [2018-11-10 02:30:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 02:30:12,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:12,535 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-11-10 02:30:12,535 INFO L424 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:12,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1446422260, now seen corresponding path program 1 times [2018-11-10 02:30:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:30:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:12,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:12,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:30:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 02:30:12,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:12,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:30:12,648 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 02:30:12,649 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-11-10 02:30:12,650 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:30:12,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:30:12,657 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:30:12,686 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 02:30:12,686 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-11-10 02:30:12,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:12,689 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 02:30:12,754 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 75.27% of their original sizes. [2018-11-10 02:30:12,754 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 02:30:12,978 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 02:30:12,979 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 02:30:12,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:30:12,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-11-10 02:30:12,979 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:30:12,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 02:30:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 02:30:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:30:12,980 INFO L87 Difference]: Start difference. First operand 470 states and 587 transitions. Second operand 12 states. [2018-11-10 02:30:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:14,275 INFO L93 Difference]: Finished difference Result 1440 states and 1858 transitions. [2018-11-10 02:30:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 02:30:14,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-10 02:30:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:14,279 INFO L225 Difference]: With dead ends: 1440 [2018-11-10 02:30:14,279 INFO L226 Difference]: Without dead ends: 1260 [2018-11-10 02:30:14,280 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:30:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2018-11-10 02:30:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 470. [2018-11-10 02:30:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-11-10 02:30:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 587 transitions. [2018-11-10 02:30:14,363 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 587 transitions. Word has length 65 [2018-11-10 02:30:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:14,363 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 587 transitions. [2018-11-10 02:30:14,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 02:30:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 587 transitions. [2018-11-10 02:30:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 02:30:14,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:14,365 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:14,366 INFO L424 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:14,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:14,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1946768196, now seen corresponding path program 1 times [2018-11-10 02:30:14,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:30:14,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:14,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:14,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:30:14,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:30:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:30:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:30:14,400 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 02:30:14,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:30:14 BoogieIcfgContainer [2018-11-10 02:30:14,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 02:30:14,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:30:14,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:30:14,442 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:30:14,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:29:36" (3/4) ... [2018-11-10 02:30:14,446 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:30:14,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:30:14,447 INFO L168 Benchmark]: Toolchain (without parser) took 38700.07 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 908.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -105.5 MB). Peak memory consumption was 802.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:30:14,448 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:30:14,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.28 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 936.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:30:14,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.39 ms. Allocated memory is still 1.0 GB. Free memory is still 936.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:30:14,449 INFO L168 Benchmark]: Boogie Preprocessor took 72.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:30:14,449 INFO L168 Benchmark]: RCFGBuilder took 334.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 02:30:14,449 INFO L168 Benchmark]: TraceAbstraction took 38053.41 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 771.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.2 MB). Peak memory consumption was 825.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:30:14,450 INFO L168 Benchmark]: Witness Printer took 4.15 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:30:14,452 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 207.28 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 936.1 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 23.39 ms. Allocated memory is still 1.0 GB. Free memory is still 936.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38053.41 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 771.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.2 MB). Peak memory consumption was 825.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.15 ms. Allocated memory is still 1.9 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, 37.9s OverallTime, 37 OverallIterations, 4 TraceHistogramMax, 25.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6277 SDtfs, 9372 SDslu, 18925 SDs, 0 SdLazy, 8001 SolverSat, 441 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 54 DeclaredPredicates, 1729 GetRequests, 1464 SyntacticMatches, 6 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3.3s 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, 3.9s AbstIntTime, 29 AbstIntIterations, 27 AbstIntStrong, 0.9738582005423356 AbsIntWeakeningRatio, 0.7154870357393133 AbsIntAvgWeakeningVarsNumRemoved, 5.6846531184302735 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 16465 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s 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-11-10 02:30:16,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:30:16,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:30:16,119 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:30:16,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:30:16,121 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:30:16,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:30:16,123 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:30:16,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:30:16,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:30:16,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:30:16,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:30:16,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:30:16,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:30:16,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:30:16,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:30:16,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:30:16,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:30:16,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:30:16,137 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:30:16,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:30:16,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:30:16,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:30:16,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:30:16,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:30:16,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:30:16,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:30:16,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:30:16,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:30:16,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:30:16,146 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:30:16,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:30:16,147 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:30:16,147 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:30:16,148 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:30:16,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:30:16,150 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 02:30:16,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:30:16,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:30:16,165 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:30:16,165 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 02:30:16,165 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 02:30:16,165 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 02:30:16,165 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 02:30:16,166 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 02:30:16,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:30:16,166 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:30:16,167 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:30:16,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:30:16,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:30:16,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:30:16,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:30:16,169 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 02:30:16,169 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 02:30:16,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:30:16,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:30:16,169 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:30:16,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:30:16,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:30:16,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:30:16,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 02:30:16,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:30:16,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:30:16,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:30:16,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:30:16,171 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 02:30:16,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:30:16,171 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 02:30:16,171 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 02:30:16,172 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_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-11-10 02:30:16,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:30:16,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:30:16,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:30:16,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:30:16,227 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:30:16,228 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 02:30:16,279 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data/9129a5616/b6f222fdb33848d2a292fbc2b9bae045/FLAGaf1146d4a [2018-11-10 02:30:16,627 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:30:16,628 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 02:30:16,634 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data/9129a5616/b6f222fdb33848d2a292fbc2b9bae045/FLAGaf1146d4a [2018-11-10 02:30:16,645 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/data/9129a5616/b6f222fdb33848d2a292fbc2b9bae045 [2018-11-10 02:30:16,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:30:16,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:30:16,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:30:16,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:30:16,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:30:16,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b1e68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16, skipping insertion in model container [2018-11-10 02:30:16,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:30:16,683 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:30:16,844 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:30:16,848 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:30:16,886 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:30:16,901 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:30:16,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16 WrapperNode [2018-11-10 02:30:16,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:30:16,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:30:16,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:30:16,903 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:30:16,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:30:16,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:30:16,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:30:16,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:30:16,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... [2018-11-10 02:30:16,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:30:16,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:30:16,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:30:16,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:30:16,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:30:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 02:30:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 02:30:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-10 02:30:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-10 02:30:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:30:17,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:30:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 02:30:17,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 02:30:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 02:30:17,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 02:30:17,324 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:30:17,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:30:17 BoogieIcfgContainer [2018-11-10 02:30:17,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:30:17,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 02:30:17,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 02:30:17,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 02:30:17,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:30:16" (1/3) ... [2018-11-10 02:30:17,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a438237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:30:17, skipping insertion in model container [2018-11-10 02:30:17,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:16" (2/3) ... [2018-11-10 02:30:17,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a438237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:30:17, skipping insertion in model container [2018-11-10 02:30:17,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:30:17" (3/3) ... [2018-11-10 02:30:17,332 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 02:30:17,341 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 02:30:17,350 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 02:30:17,364 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 02:30:17,389 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:30:17,390 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 02:30:17,390 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 02:30:17,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 02:30:17,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:30:17,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:30:17,391 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 02:30:17,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:30:17,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 02:30:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-10 02:30:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 02:30:17,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:17,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:17,412 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:17,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:17,416 INFO L82 PathProgramCache]: Analyzing trace with hash 572437916, now seen corresponding path program 1 times [2018-11-10 02:30:17,419 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:17,420 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:17,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:17,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:17,541 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:17,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:17,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:30:17,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 02:30:17,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 02:30:17,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:30:17,565 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-10 02:30:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:17,590 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-11-10 02:30:17,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:30:17,591 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 02:30:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:17,599 INFO L225 Difference]: With dead ends: 79 [2018-11-10 02:30:17,599 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 02:30:17,602 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-11-10 02:30:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 02:30:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 02:30:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 02:30:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-11-10 02:30:17,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 21 [2018-11-10 02:30:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:17,635 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2018-11-10 02:30:17,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 02:30:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2018-11-10 02:30:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 02:30:17,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:17,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:17,638 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:17,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash 855921951, now seen corresponding path program 1 times [2018-11-10 02:30:17,639 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:17,639 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:17,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:17,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:17,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:17,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:17,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:30:17,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:30:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:30:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:30:17,747 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 4 states. [2018-11-10 02:30:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:18,005 INFO L93 Difference]: Finished difference Result 138 states and 227 transitions. [2018-11-10 02:30:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:30:18,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 02:30:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:18,008 INFO L225 Difference]: With dead ends: 138 [2018-11-10 02:30:18,008 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 02:30:18,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:30:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 02:30:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-11-10 02:30:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 02:30:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2018-11-10 02:30:18,023 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 23 [2018-11-10 02:30:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:18,024 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2018-11-10 02:30:18,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:30:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2018-11-10 02:30:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 02:30:18,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:18,025 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:18,026 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:18,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash -937448708, now seen corresponding path program 1 times [2018-11-10 02:30:18,026 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:18,027 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:18,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:18,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:18,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:18,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:18,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:30:18,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:30:18,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:30:18,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:30:18,111 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 5 states. [2018-11-10 02:30:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:18,355 INFO L93 Difference]: Finished difference Result 191 states and 306 transitions. [2018-11-10 02:30:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:30:18,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-10 02:30:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:18,357 INFO L225 Difference]: With dead ends: 191 [2018-11-10 02:30:18,357 INFO L226 Difference]: Without dead ends: 157 [2018-11-10 02:30:18,358 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-11-10 02:30:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-10 02:30:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2018-11-10 02:30:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 02:30:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2018-11-10 02:30:18,369 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 24 [2018-11-10 02:30:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:18,369 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2018-11-10 02:30:18,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:30:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2018-11-10 02:30:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 02:30:18,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:18,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:18,371 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:18,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:18,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1385230186, now seen corresponding path program 1 times [2018-11-10 02:30:18,372 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:18,372 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:18,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:18,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:18,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:18,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:18,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 02:30:18,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 02:30:18,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:30:18,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:30:18,470 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand 7 states. [2018-11-10 02:30:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:18,700 INFO L93 Difference]: Finished difference Result 240 states and 377 transitions. [2018-11-10 02:30:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:30:18,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-10 02:30:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:18,704 INFO L225 Difference]: With dead ends: 240 [2018-11-10 02:30:18,704 INFO L226 Difference]: Without dead ends: 206 [2018-11-10 02:30:18,705 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-11-10 02:30:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-10 02:30:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2018-11-10 02:30:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 02:30:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 204 transitions. [2018-11-10 02:30:18,722 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 204 transitions. Word has length 25 [2018-11-10 02:30:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:18,722 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 204 transitions. [2018-11-10 02:30:18,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 02:30:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 204 transitions. [2018-11-10 02:30:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 02:30:18,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:18,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:18,724 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:18,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash 364161832, now seen corresponding path program 1 times [2018-11-10 02:30:18,724 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:18,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:18,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:18,807 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:18,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:18,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:30:18,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:30:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:30:18,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:30:18,814 INFO L87 Difference]: Start difference. First operand 135 states and 204 transitions. Second operand 6 states. [2018-11-10 02:30:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:19,025 INFO L93 Difference]: Finished difference Result 260 states and 399 transitions. [2018-11-10 02:30:19,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:30:19,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-10 02:30:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:19,027 INFO L225 Difference]: With dead ends: 260 [2018-11-10 02:30:19,027 INFO L226 Difference]: Without dead ends: 226 [2018-11-10 02:30:19,028 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-11-10 02:30:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-10 02:30:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 105. [2018-11-10 02:30:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 02:30:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2018-11-10 02:30:19,041 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 25 [2018-11-10 02:30:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:19,041 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2018-11-10 02:30:19,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:30:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2018-11-10 02:30:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 02:30:19,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:19,043 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:19,044 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:19,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash 938751165, now seen corresponding path program 1 times [2018-11-10 02:30:19,044 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:19,045 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:19,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:19,088 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:19,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:19,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:30:19,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:30:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:30:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:30:19,094 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand 3 states. [2018-11-10 02:30:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:19,116 INFO L93 Difference]: Finished difference Result 146 states and 205 transitions. [2018-11-10 02:30:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:30:19,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 02:30:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:19,118 INFO L225 Difference]: With dead ends: 146 [2018-11-10 02:30:19,118 INFO L226 Difference]: Without dead ends: 127 [2018-11-10 02:30:19,118 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-11-10 02:30:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-10 02:30:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-10 02:30:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 02:30:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2018-11-10 02:30:19,129 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 37 [2018-11-10 02:30:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:19,129 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2018-11-10 02:30:19,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:30:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2018-11-10 02:30:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 02:30:19,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:19,131 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:19,131 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:19,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:19,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1055393541, now seen corresponding path program 1 times [2018-11-10 02:30:19,132 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:19,132 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:19,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:19,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:19,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:30:19,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:30:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:30:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:30:19,211 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand 4 states. [2018-11-10 02:30:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:19,327 INFO L93 Difference]: Finished difference Result 336 states and 478 transitions. [2018-11-10 02:30:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:30:19,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 02:30:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:19,329 INFO L225 Difference]: With dead ends: 336 [2018-11-10 02:30:19,329 INFO L226 Difference]: Without dead ends: 236 [2018-11-10 02:30:19,329 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-11-10 02:30:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-10 02:30:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 217. [2018-11-10 02:30:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 02:30:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 308 transitions. [2018-11-10 02:30:19,344 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 308 transitions. Word has length 37 [2018-11-10 02:30:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:19,345 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 308 transitions. [2018-11-10 02:30:19,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:30:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 308 transitions. [2018-11-10 02:30:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 02:30:19,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:19,347 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:19,348 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:19,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:19,348 INFO L82 PathProgramCache]: Analyzing trace with hash 154938663, now seen corresponding path program 1 times [2018-11-10 02:30:19,348 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:19,350 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:19,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:19,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:19,416 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:19,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:19,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:30:19,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:30:19,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:30:19,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:30:19,419 INFO L87 Difference]: Start difference. First operand 217 states and 308 transitions. Second operand 5 states. [2018-11-10 02:30:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:19,525 INFO L93 Difference]: Finished difference Result 439 states and 624 transitions. [2018-11-10 02:30:19,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:30:19,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 02:30:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:19,528 INFO L225 Difference]: With dead ends: 439 [2018-11-10 02:30:19,528 INFO L226 Difference]: Without dead ends: 339 [2018-11-10 02:30:19,529 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-11-10 02:30:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-10 02:30:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 217. [2018-11-10 02:30:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 02:30:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 308 transitions. [2018-11-10 02:30:19,546 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 308 transitions. Word has length 38 [2018-11-10 02:30:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:19,546 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 308 transitions. [2018-11-10 02:30:19,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:30:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 308 transitions. [2018-11-10 02:30:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 02:30:19,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:19,548 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:19,549 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:19,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash 157856934, now seen corresponding path program 1 times [2018-11-10 02:30:19,561 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:19,561 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:19,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:19,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:19,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:19,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:19,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 02:30:19,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 02:30:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:30:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:30:19,651 INFO L87 Difference]: Start difference. First operand 217 states and 308 transitions. Second operand 7 states. [2018-11-10 02:30:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:19,771 INFO L93 Difference]: Finished difference Result 536 states and 758 transitions. [2018-11-10 02:30:19,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:30:19,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-10 02:30:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:19,773 INFO L225 Difference]: With dead ends: 536 [2018-11-10 02:30:19,773 INFO L226 Difference]: Without dead ends: 436 [2018-11-10 02:30:19,774 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-11-10 02:30:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-10 02:30:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 299. [2018-11-10 02:30:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-10 02:30:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 420 transitions. [2018-11-10 02:30:19,791 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 420 transitions. Word has length 39 [2018-11-10 02:30:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:19,791 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 420 transitions. [2018-11-10 02:30:19,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 02:30:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 420 transitions. [2018-11-10 02:30:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 02:30:19,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:19,793 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:19,793 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:19,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash -351616156, now seen corresponding path program 1 times [2018-11-10 02:30:19,794 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:19,794 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:30:19,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:19,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:19,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:19,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:30:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:30:19,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:30:19,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:30:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:30:19,863 INFO L87 Difference]: Start difference. First operand 299 states and 420 transitions. Second operand 6 states. [2018-11-10 02:30:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:20,042 INFO L93 Difference]: Finished difference Result 534 states and 752 transitions. [2018-11-10 02:30:20,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:30:20,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-10 02:30:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:20,045 INFO L225 Difference]: With dead ends: 534 [2018-11-10 02:30:20,045 INFO L226 Difference]: Without dead ends: 434 [2018-11-10 02:30:20,045 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-11-10 02:30:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-10 02:30:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 209. [2018-11-10 02:30:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-10 02:30:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 290 transitions. [2018-11-10 02:30:20,059 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 290 transitions. Word has length 39 [2018-11-10 02:30:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:20,060 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 290 transitions. [2018-11-10 02:30:20,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:30:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 290 transitions. [2018-11-10 02:30:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 02:30:20,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:20,061 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:20,061 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:20,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -433809, now seen corresponding path program 1 times [2018-11-10 02:30:20,062 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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-11-10 02:30:20,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:20,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:20,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:30:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:20,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:20,175 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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-11-10 02:30:20,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:20,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:20,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:30:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:30:20,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 02:30:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4, 4] total 12 [2018-11-10 02:30:20,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 02:30:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 02:30:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:30:20,279 INFO L87 Difference]: Start difference. First operand 209 states and 290 transitions. Second operand 12 states. [2018-11-10 02:30:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:21,219 INFO L93 Difference]: Finished difference Result 1326 states and 2055 transitions. [2018-11-10 02:30:21,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 02:30:21,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-10 02:30:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:21,223 INFO L225 Difference]: With dead ends: 1326 [2018-11-10 02:30:21,224 INFO L226 Difference]: Without dead ends: 1147 [2018-11-10 02:30:21,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2018-11-10 02:30:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2018-11-10 02:30:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 852. [2018-11-10 02:30:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-11-10 02:30:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1244 transitions. [2018-11-10 02:30:21,266 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1244 transitions. Word has length 41 [2018-11-10 02:30:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:21,266 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1244 transitions. [2018-11-10 02:30:21,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 02:30:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1244 transitions. [2018-11-10 02:30:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 02:30:21,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:21,268 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:21,269 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:21,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash 797419983, now seen corresponding path program 1 times [2018-11-10 02:30:21,270 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:21,270 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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-11-10 02:30:21,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:21,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 02:30:21,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:30:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 02:30:21,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:21,400 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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-11-10 02:30:21,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:21,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 02:30:21,455 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:30:21,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:30:21,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2018-11-10 02:30:21,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:30:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:30:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:30:21,476 INFO L87 Difference]: Start difference. First operand 852 states and 1244 transitions. Second operand 9 states. [2018-11-10 02:30:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:30:21,986 INFO L93 Difference]: Finished difference Result 2412 states and 3582 transitions. [2018-11-10 02:30:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 02:30:21,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-10 02:30:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:30:21,992 INFO L225 Difference]: With dead ends: 2412 [2018-11-10 02:30:21,992 INFO L226 Difference]: Without dead ends: 1968 [2018-11-10 02:30:21,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-10 02:30:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-11-10 02:30:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1598. [2018-11-10 02:30:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-11-10 02:30:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2308 transitions. [2018-11-10 02:30:22,058 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2308 transitions. Word has length 64 [2018-11-10 02:30:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:30:22,059 INFO L481 AbstractCegarLoop]: Abstraction has 1598 states and 2308 transitions. [2018-11-10 02:30:22,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:30:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2308 transitions. [2018-11-10 02:30:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 02:30:22,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:30:22,061 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:30:22,061 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:30:22,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:30:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1946768196, now seen corresponding path program 1 times [2018-11-10 02:30:22,062 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:30:22,062 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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-11-10 02:30:22,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:22,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 02:30:23,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:30:23,751 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-10 02:30:23,859 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-10 02:30:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 02:30:26,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:30:26,400 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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-11-10 02:30:26,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:30:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:30:26,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:30:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 02:30:26,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:30:27,171 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-10 02:30:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 02:30:27,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 02:30:27,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23] total 50 [2018-11-10 02:30:27,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-10 02:30:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-10 02:30:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2237, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 02:30:27,730 INFO L87 Difference]: Start difference. First operand 1598 states and 2308 transitions. Second operand 50 states. [2018-11-10 02:30:33,887 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-11-10 02:30:39,923 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-10 02:30:40,230 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-11-10 02:30:41,929 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-11-10 02:30:47,719 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2018-11-10 02:30:50,049 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-11-10 02:30:50,840 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-11-10 02:30:53,961 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2018-11-10 02:30:55,353 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-11-10 02:30:56,025 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-11-10 02:30:56,485 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-11-10 02:30:58,018 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-10 02:30:59,567 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2018-11-10 02:31:01,263 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-10 02:31:01,888 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-11-10 02:31:02,880 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2018-11-10 02:31:04,447 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-11-10 02:31:05,070 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-11-10 02:31:05,895 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2018-11-10 02:31:06,895 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-11-10 02:31:08,133 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-11-10 02:31:08,687 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2018-11-10 02:31:09,633 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2018-11-10 02:31:10,457 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-10 02:31:13,663 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2018-11-10 02:31:14,129 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-11-10 02:31:16,141 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-11-10 02:31:16,559 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2018-11-10 02:31:18,264 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-11-10 02:31:22,112 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-11-10 02:31:23,780 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-10 02:31:24,141 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-11-10 02:31:24,954 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-11-10 02:31:25,487 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-11-10 02:31:26,664 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-11-10 02:31:27,230 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-11-10 02:31:27,691 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2018-11-10 02:31:28,187 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-11-10 02:31:28,728 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2018-11-10 02:31:29,822 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2018-11-10 02:31:30,381 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-10 02:31:31,009 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2018-11-10 02:31:31,751 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-11-10 02:31:32,255 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-11-10 02:31:33,308 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-10 02:31:35,097 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-10 02:31:35,842 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-11-10 02:31:36,722 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-11-10 02:31:37,342 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-10 02:31:37,875 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-10 02:31:38,848 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-10 02:31:39,318 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2018-11-10 02:31:40,117 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2018-11-10 02:31:40,915 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-11-10 02:31:41,588 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 02:31:42,032 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-11-10 02:31:42,452 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-11-10 02:31:43,320 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-10 02:31:43,820 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-11-10 02:31:44,798 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2018-11-10 02:31:45,657 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-11-10 02:31:46,443 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2018-11-10 02:31:48,112 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-11-10 02:31:48,548 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-11-10 02:31:48,999 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2018-11-10 02:31:49,973 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2018-11-10 02:31:50,656 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-10 02:31:52,090 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-11-10 02:31:52,889 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-11-10 02:31:54,064 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2018-11-10 02:31:55,011 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-11-10 02:31:56,406 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-11-10 02:31:57,143 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-11-10 02:31:58,814 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-11-10 02:31:59,887 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-11-10 02:32:00,798 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-11-10 02:32:01,453 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2018-11-10 02:32:02,531 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-11-10 02:32:03,110 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2018-11-10 02:32:04,288 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-11-10 02:32:04,987 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2018-11-10 02:32:05,961 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-10 02:32:06,472 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 02:32:06,834 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-10 02:32:07,589 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-11-10 02:32:08,429 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-11-10 02:32:09,078 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-10 02:32:09,625 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-11-10 02:32:10,333 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-11-10 02:32:10,766 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-11-10 02:32:11,898 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-11-10 02:32:13,280 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 115 [2018-11-10 02:32:14,588 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2018-11-10 02:32:15,507 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-10 02:32:16,285 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-11-10 02:32:16,906 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2018-11-10 02:32:17,772 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-10 02:32:19,009 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-10 02:32:20,121 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-11-10 02:32:21,192 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 113 [2018-11-10 02:32:21,924 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2018-11-10 02:32:22,567 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-11-10 02:32:23,528 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2018-11-10 02:32:24,551 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-10 02:32:25,704 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2018-11-10 02:32:26,228 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-10 02:32:27,613 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2018-11-10 02:32:28,188 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2018-11-10 02:32:29,025 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 118 [2018-11-10 02:32:29,922 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-11-10 02:32:31,858 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-10 02:32:32,398 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-11-10 02:32:33,344 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-11-10 02:32:34,543 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-11-10 02:32:35,661 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-11-10 02:32:36,645 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-11-10 02:32:37,517 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-11-10 02:32:38,711 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-11-10 02:32:39,184 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-11-10 02:32:40,173 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 118 [2018-11-10 02:32:40,974 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2018-11-10 02:32:41,273 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-10 02:32:42,233 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-11-10 02:32:43,297 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2018-11-10 02:32:44,117 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 121 [2018-11-10 02:32:44,988 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2018-11-10 02:32:45,782 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2018-11-10 02:32:46,870 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2018-11-10 02:32:47,304 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-10 02:32:48,114 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-11-10 02:32:49,073 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2018-11-10 02:32:50,142 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2018-11-10 02:32:50,639 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-11-10 02:32:51,588 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2018-11-10 02:32:52,604 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-11-10 02:32:54,102 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-11-10 02:32:54,886 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2018-11-10 02:32:55,780 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 111 [2018-11-10 02:32:56,980 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-11-10 02:32:58,105 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-10 02:33:00,488 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2018-11-10 02:33:01,347 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2018-11-10 02:33:02,455 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-11-10 02:33:04,226 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-10 02:33:05,309 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-10 02:33:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:33:05,345 INFO L93 Difference]: Finished difference Result 11705 states and 17008 transitions. [2018-11-10 02:33:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2018-11-10 02:33:05,347 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-11-10 02:33:05,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:33:05,369 INFO L225 Difference]: With dead ends: 11705 [2018-11-10 02:33:05,369 INFO L226 Difference]: Without dead ends: 11269 [2018-11-10 02:33:05,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45854 ImplicationChecksByTransitivity, 138.2s TimeCoverageRelationStatistics Valid=22983, Invalid=99867, Unknown=0, NotChecked=0, Total=122850 [2018-11-10 02:33:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11269 states. [2018-11-10 02:33:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11269 to 4071. [2018-11-10 02:33:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4071 states. [2018-11-10 02:33:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 6085 transitions. [2018-11-10 02:33:05,608 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 6085 transitions. Word has length 66 [2018-11-10 02:33:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:33:05,609 INFO L481 AbstractCegarLoop]: Abstraction has 4071 states and 6085 transitions. [2018-11-10 02:33:05,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-10 02:33:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6085 transitions. [2018-11-10 02:33:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 02:33:05,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:33:05,611 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:33:05,612 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:33:05,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:33:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1129119746, now seen corresponding path program 1 times [2018-11-10 02:33:05,612 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:33:05,612 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/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-11-10 02:33:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:33:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:33:05,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:33:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:33:05,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:33:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:33:05,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:33:05,735 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:33:05,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:33:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:33:05,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:33:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:33:05,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:33:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 02:33:05,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 02:33:05,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 4] total 10 [2018-11-10 02:33:05,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 02:33:05,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:33:05,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:33:05,831 INFO L87 Difference]: Start difference. First operand 4071 states and 6085 transitions. Second operand 10 states. [2018-11-10 02:33:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:33:06,987 INFO L93 Difference]: Finished difference Result 9893 states and 14976 transitions. [2018-11-10 02:33:06,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 02:33:06,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-10 02:33:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:33:06,999 INFO L225 Difference]: With dead ends: 9893 [2018-11-10 02:33:06,999 INFO L226 Difference]: Without dead ends: 5870 [2018-11-10 02:33:07,004 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-11-10 02:33:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5870 states. [2018-11-10 02:33:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5870 to 4982. [2018-11-10 02:33:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4982 states. [2018-11-10 02:33:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 6892 transitions. [2018-11-10 02:33:07,217 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 6892 transitions. Word has length 66 [2018-11-10 02:33:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:33:07,217 INFO L481 AbstractCegarLoop]: Abstraction has 4982 states and 6892 transitions. [2018-11-10 02:33:07,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 02:33:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 6892 transitions. [2018-11-10 02:33:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 02:33:07,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:33:07,219 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:33:07,220 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:33:07,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:33:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1904298426, now seen corresponding path program 1 times [2018-11-10 02:33:07,220 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:33:07,220 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:33:07,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:33:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:33:07,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:33:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 02:33:07,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:33:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 02:33:07,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:33:07,361 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:33:07,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:33:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:33:07,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:33:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 02:33:07,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:33:07,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:33:07,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2018-11-10 02:33:07,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 02:33:07,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 02:33:07,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-10 02:33:07,473 INFO L87 Difference]: Start difference. First operand 4982 states and 6892 transitions. Second operand 14 states. [2018-11-10 02:33:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:33:08,864 INFO L93 Difference]: Finished difference Result 11501 states and 16017 transitions. [2018-11-10 02:33:08,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 02:33:08,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-11-10 02:33:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:33:08,877 INFO L225 Difference]: With dead ends: 11501 [2018-11-10 02:33:08,877 INFO L226 Difference]: Without dead ends: 6342 [2018-11-10 02:33:08,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2018-11-10 02:33:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6342 states. [2018-11-10 02:33:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6342 to 3707. [2018-11-10 02:33:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2018-11-10 02:33:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4592 transitions. [2018-11-10 02:33:09,145 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4592 transitions. Word has length 66 [2018-11-10 02:33:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:33:09,145 INFO L481 AbstractCegarLoop]: Abstraction has 3707 states and 4592 transitions. [2018-11-10 02:33:09,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 02:33:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4592 transitions. [2018-11-10 02:33:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 02:33:09,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:33:09,148 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:33:09,148 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:33:09,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:33:09,150 INFO L82 PathProgramCache]: Analyzing trace with hash 446581663, now seen corresponding path program 1 times [2018-11-10 02:33:09,151 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:33:09,151 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:33:09,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:33:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:33:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:33:09,305 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 02:33:09,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:33:09 BoogieIcfgContainer [2018-11-10 02:33:09,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 02:33:09,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:33:09,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:33:09,374 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:33:09,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:30:17" (3/4) ... [2018-11-10 02:33:09,378 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 02:33:09,476 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_630e8601-787a-4037-be8f-4fcd6e5f0043/bin-2019/utaipan/witness.graphml [2018-11-10 02:33:09,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:33:09,477 INFO L168 Benchmark]: Toolchain (without parser) took 172829.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 278.9 MB). Free memory was 950.6 MB in the beginning and 830.5 MB in the end (delta: 120.0 MB). Peak memory consumption was 399.0 MB. Max. memory is 11.5 GB. [2018-11-10 02:33:09,478 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:33:09,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.54 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 933.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:33:09,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.98 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:33:09,479 INFO L168 Benchmark]: Boogie Preprocessor took 31.34 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:33:09,479 INFO L168 Benchmark]: RCFGBuilder took 370.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-11-10 02:33:09,479 INFO L168 Benchmark]: TraceAbstraction took 172047.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 1.1 GB in the beginning and 840.4 MB in the end (delta: 260.8 MB). Peak memory consumption was 403.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:33:09,480 INFO L168 Benchmark]: Witness Printer took 102.85 ms. Allocated memory is still 1.3 GB. Free memory was 840.4 MB in the beginning and 830.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:33:09,482 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.20 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 252.54 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 933.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.98 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.34 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 370.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 172047.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 1.1 GB in the beginning and 840.4 MB in the end (delta: 260.8 MB). Peak memory consumption was 403.4 MB. Max. memory is 11.5 GB. * Witness Printer took 102.85 ms. Allocated memory is still 1.3 GB. Free memory was 840.4 MB in the beginning and 830.5 MB in the end (delta: 9.9 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, 171.9s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 163.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1948 SDtfs, 7198 SDslu, 10816 SDs, 0 SdLazy, 17516 SolverSat, 1357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1746 GetRequests, 1266 SyntacticMatches, 9 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46392 ImplicationChecksByTransitivity, 139.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4982occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 12144 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s 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...