./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c --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_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/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 45b185c6c694406b0734db5727dff1b8fd93ebcf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:46:30,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:46:30,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:46:30,636 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:46:30,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:46:30,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:46:30,639 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:46:30,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:46:30,642 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:46:30,643 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:46:30,644 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:46:30,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:46:30,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:46:30,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:46:30,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:46:30,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:46:30,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:46:30,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:46:30,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:46:30,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:46:30,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:46:30,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:46:30,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:46:30,658 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:46:30,658 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:46:30,659 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:46:30,660 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:46:30,661 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:46:30,661 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:46:30,662 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:46:30,662 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:46:30,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:46:30,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:46:30,664 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:46:30,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:46:30,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:46:30,666 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 03:46:30,679 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:46:30,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:46:30,680 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:46:30,680 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:46:30,680 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:46:30,680 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:46:30,680 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 03:46:30,681 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:46:30,681 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 03:46:30,681 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 03:46:30,681 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:46:30,682 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:46:30,682 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:46:30,682 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:46:30,682 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:46:30,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:46:30,683 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:46:30,683 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:46:30,683 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:46:30,683 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:46:30,683 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:46:30,684 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:46:30,684 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:46:30,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:46:30,684 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:46:30,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:46:30,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:46:30,685 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:46:30,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:46:30,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:46:30,685 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 03:46:30,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:46:30,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:46:30,686 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 03:46:30,686 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_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/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 -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2018-11-10 03:46:30,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:46:30,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:46:30,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:46:30,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:46:30,728 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:46:30,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 03:46:30,774 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/data/51e858fb7/14fc2019ca0749c6b8f67bafe09c7883/FLAGf108f8e61 [2018-11-10 03:46:31,115 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:46:31,116 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 03:46:31,122 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/data/51e858fb7/14fc2019ca0749c6b8f67bafe09c7883/FLAGf108f8e61 [2018-11-10 03:46:31,132 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/data/51e858fb7/14fc2019ca0749c6b8f67bafe09c7883 [2018-11-10 03:46:31,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:46:31,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:46:31,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:46:31,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:46:31,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:46:31,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d64a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31, skipping insertion in model container [2018-11-10 03:46:31,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:46:31,173 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:46:31,317 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:46:31,320 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:46:31,351 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:46:31,361 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:46:31,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31 WrapperNode [2018-11-10 03:46:31,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:46:31,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:46:31,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:46:31,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:46:31,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:46:31,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:46:31,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:46:31,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:46:31,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... [2018-11-10 03:46:31,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:46:31,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:46:31,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:46:31,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:46:31,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/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 03:46:31,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:46:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:46:31,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:46:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:46:31,505 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-10 03:46:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-10 03:46:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-10 03:46:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-10 03:46:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:46:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:46:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 03:46:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 03:46:31,782 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:46:31,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:46:31 BoogieIcfgContainer [2018-11-10 03:46:31,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:46:31,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:46:31,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:46:31,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:46:31,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:46:31" (1/3) ... [2018-11-10 03:46:31,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42834502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:46:31, skipping insertion in model container [2018-11-10 03:46:31,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:31" (2/3) ... [2018-11-10 03:46:31,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42834502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:46:31, skipping insertion in model container [2018-11-10 03:46:31,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:46:31" (3/3) ... [2018-11-10 03:46:31,792 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 03:46:31,799 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:46:31,805 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:46:31,821 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:46:31,857 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:46:31,857 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:46:31,857 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:46:31,857 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:46:31,857 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:46:31,858 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:46:31,858 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:46:31,858 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:46:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-10 03:46:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 03:46:31,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:31,887 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:31,889 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:31,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1192633110, now seen corresponding path program 1 times [2018-11-10 03:46:31,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:31,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:31,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:31,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:31,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 03:46:32,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:32,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:32,081 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:32,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:32,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:32,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:32,098 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-11-10 03:46:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:32,138 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2018-11-10 03:46:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:32,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 03:46:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:32,149 INFO L225 Difference]: With dead ends: 122 [2018-11-10 03:46:32,149 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 03:46:32,152 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 03:46:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 03:46:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-10 03:46:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 03:46:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-10 03:46:32,186 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 48 [2018-11-10 03:46:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:32,188 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 03:46:32,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2018-11-10 03:46:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 03:46:32,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:32,191 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:32,191 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:32,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:32,192 INFO L82 PathProgramCache]: Analyzing trace with hash 817956730, now seen corresponding path program 1 times [2018-11-10 03:46:32,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:32,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:32,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:32,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:32,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:32,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:32,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:32,296 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-10 03:46:32,297 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [140], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:32,336 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:32,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:32,445 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:32,463 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:46:32,464 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 03:46:32,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:32,472 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:46:32,567 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2018-11-10 03:46:32,567 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:46:32,694 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-10 03:46:32,694 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:46:32,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:46:32,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-11-10 03:46:32,695 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:32,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 03:46:32,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:46:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:46:32,697 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 11 states. [2018-11-10 03:46:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:33,547 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2018-11-10 03:46:33,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 03:46:33,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-10 03:46:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:33,550 INFO L225 Difference]: With dead ends: 130 [2018-11-10 03:46:33,550 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 03:46:33,552 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:46:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 03:46:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-11-10 03:46:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 03:46:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2018-11-10 03:46:33,567 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 50 [2018-11-10 03:46:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:33,567 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2018-11-10 03:46:33,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 03:46:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-10 03:46:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 03:46:33,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:33,570 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:33,571 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:33,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:33,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1569223978, now seen corresponding path program 1 times [2018-11-10 03:46:33,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:33,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:33,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:33,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:33,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:33,631 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 03:46:33,631 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:33,633 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:33,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:33,642 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:33,651 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:46:33,651 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 03:46:33,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:33,654 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:46:33,694 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 71.85% of their original sizes. [2018-11-10 03:46:33,695 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:46:33,819 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 03:46:33,819 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:46:33,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:46:33,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-10 03:46:33,820 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:33,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:46:33,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:46:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:46:33,821 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand 12 states. [2018-11-10 03:46:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:34,519 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2018-11-10 03:46:34,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 03:46:34,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-10 03:46:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:34,521 INFO L225 Difference]: With dead ends: 128 [2018-11-10 03:46:34,521 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 03:46:34,522 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:46:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 03:46:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-11-10 03:46:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 03:46:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-11-10 03:46:34,535 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 56 [2018-11-10 03:46:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:34,536 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-11-10 03:46:34,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:46:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-11-10 03:46:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 03:46:34,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:34,537 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:34,538 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:34,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1810436268, now seen corresponding path program 1 times [2018-11-10 03:46:34,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:34,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:34,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:34,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:34,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:34,630 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-10 03:46:34,630 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [33], [65], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:34,632 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:34,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:34,638 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:34,644 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:46:34,644 INFO L272 AbstractInterpreter]: Visited 19 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 03:46:34,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:34,651 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:46:34,681 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 64.67% of their original sizes. [2018-11-10 03:46:34,681 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:46:34,766 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-10 03:46:34,766 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:46:34,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:46:34,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-10 03:46:34,766 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:34,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:46:34,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:46:34,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:46:34,767 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 12 states. [2018-11-10 03:46:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:35,416 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2018-11-10 03:46:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 03:46:35,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-10 03:46:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:35,417 INFO L225 Difference]: With dead ends: 136 [2018-11-10 03:46:35,417 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 03:46:35,418 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-11-10 03:46:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 03:46:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2018-11-10 03:46:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 03:46:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-11-10 03:46:35,428 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 58 [2018-11-10 03:46:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:35,428 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-11-10 03:46:35,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:46:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-11-10 03:46:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 03:46:35,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:35,430 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:35,430 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:35,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1332257313, now seen corresponding path program 1 times [2018-11-10 03:46:35,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:35,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:35,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:35,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:35,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:35,492 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 03:46:35,493 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:35,494 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:35,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:35,500 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:35,668 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:46:35,669 INFO L272 AbstractInterpreter]: Visited 34 different actions 275 times. Merged at 7 different actions 184 times. Widened at 2 different actions 28 times. Found 25 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 03:46:35,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:35,691 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:46:35,762 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 64.38% of their original sizes. [2018-11-10 03:46:35,762 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:46:36,172 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-10 03:46:36,172 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:46:36,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:46:36,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [5] total 27 [2018-11-10 03:46:36,173 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:36,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 03:46:36,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 03:46:36,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-11-10 03:46:36,174 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 24 states. [2018-11-10 03:46:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:38,617 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2018-11-10 03:46:38,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 03:46:38,617 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-11-10 03:46:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:38,619 INFO L225 Difference]: With dead ends: 135 [2018-11-10 03:46:38,619 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 03:46:38,620 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 03:46:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 03:46:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2018-11-10 03:46:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 03:46:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2018-11-10 03:46:38,633 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 60 [2018-11-10 03:46:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:38,633 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2018-11-10 03:46:38,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 03:46:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2018-11-10 03:46:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 03:46:38,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:38,637 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:38,637 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:38,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1951592733, now seen corresponding path program 1 times [2018-11-10 03:46:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:38,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:38,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:38,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:38,725 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:38,725 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 03:46:38,725 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [67], [68], [69], [74], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:38,726 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:38,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:38,731 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:38,859 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:46:38,860 INFO L272 AbstractInterpreter]: Visited 42 different actions 283 times. Merged at 7 different actions 184 times. Widened at 2 different actions 28 times. Found 25 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 03:46:38,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:38,864 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:46:38,931 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 66.71% of their original sizes. [2018-11-10 03:46:38,931 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:46:39,604 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-10 03:46:39,604 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:46:39,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:46:39,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [5] total 33 [2018-11-10 03:46:39,604 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:39,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 03:46:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 03:46:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-11-10 03:46:39,606 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 30 states. [2018-11-10 03:46:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:42,741 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2018-11-10 03:46:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 03:46:42,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-11-10 03:46:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:42,743 INFO L225 Difference]: With dead ends: 120 [2018-11-10 03:46:42,743 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 03:46:42,744 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=2400, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 03:46:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 03:46:42,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-11-10 03:46:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 03:46:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2018-11-10 03:46:42,758 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 60 [2018-11-10 03:46:42,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:42,758 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2018-11-10 03:46:42,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 03:46:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2018-11-10 03:46:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 03:46:42,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:42,760 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:42,760 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:42,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2008851035, now seen corresponding path program 1 times [2018-11-10 03:46:42,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:42,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:42,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:42,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:42,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:42,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:42,843 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:42,843 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 03:46:42,844 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [67], [68], [69], [74], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [147], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:42,845 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:42,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:42,853 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:42,969 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:46:42,969 INFO L272 AbstractInterpreter]: Visited 46 different actions 287 times. Merged at 7 different actions 184 times. Widened at 2 different actions 28 times. Found 25 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 03:46:42,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:42,983 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:46:43,052 INFO L227 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 67.41% of their original sizes. [2018-11-10 03:46:43,053 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:46:43,781 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-10 03:46:43,781 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:46:43,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:46:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [5] total 37 [2018-11-10 03:46:43,782 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:43,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 03:46:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 03:46:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 03:46:43,783 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 34 states. [2018-11-10 03:46:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:47,831 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2018-11-10 03:46:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 03:46:47,831 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 60 [2018-11-10 03:46:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:47,832 INFO L225 Difference]: With dead ends: 122 [2018-11-10 03:46:47,832 INFO L226 Difference]: Without dead ends: 97 [2018-11-10 03:46:47,834 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=335, Invalid=3571, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 03:46:47,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-10 03:46:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2018-11-10 03:46:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 03:46:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2018-11-10 03:46:47,846 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 60 [2018-11-10 03:46:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:47,846 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2018-11-10 03:46:47,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 03:46:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2018-11-10 03:46:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:46:47,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:47,848 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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 03:46:47,848 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:47,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash -840271592, now seen corresponding path program 1 times [2018-11-10 03:46:47,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:47,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:47,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:47,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:47,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:47,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:47,890 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:47,890 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 03:46:47,891 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [53], [59], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:47,892 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:47,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:47,896 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:48,084 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:46:48,084 INFO L272 AbstractInterpreter]: Visited 47 different actions 539 times. Merged at 19 different actions 352 times. Widened at 2 different actions 48 times. Found 45 fixpoints after 6 different actions. Largest state had 23 variables. [2018-11-10 03:46:48,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:48,091 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:46:48,166 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 65.18% of their original sizes. [2018-11-10 03:46:48,166 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:46:48,800 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 03:46:48,800 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:46:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:46:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [5] total 37 [2018-11-10 03:46:48,800 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:48,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 03:46:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 03:46:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 03:46:48,802 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 34 states. [2018-11-10 03:46:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:52,202 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2018-11-10 03:46:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 03:46:52,202 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-11-10 03:46:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:52,204 INFO L225 Difference]: With dead ends: 159 [2018-11-10 03:46:52,204 INFO L226 Difference]: Without dead ends: 149 [2018-11-10 03:46:52,205 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=382, Invalid=3524, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 03:46:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-10 03:46:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 112. [2018-11-10 03:46:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 03:46:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2018-11-10 03:46:52,222 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 65 [2018-11-10 03:46:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:52,223 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2018-11-10 03:46:52,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 03:46:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2018-11-10 03:46:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:46:52,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:52,224 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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 03:46:52,224 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:52,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:52,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1101763500, now seen corresponding path program 1 times [2018-11-10 03:46:52,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:52,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:52,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:52,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:52,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:52,294 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 03:46:52,294 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [55], [65], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:52,296 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:52,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:52,300 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:52,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:46:52,403 INFO L272 AbstractInterpreter]: Visited 47 different actions 424 times. Merged at 19 different actions 274 times. Widened at 2 different actions 39 times. Found 36 fixpoints after 6 different actions. Largest state had 23 variables. [2018-11-10 03:46:52,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:52,411 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:46:52,448 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 75.69% of their original sizes. [2018-11-10 03:46:52,449 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:46:52,794 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 03:46:52,794 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:46:52,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:46:52,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [5] total 29 [2018-11-10 03:46:52,794 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:52,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 03:46:52,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 03:46:52,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-11-10 03:46:52,795 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand 26 states. [2018-11-10 03:46:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:54,158 INFO L93 Difference]: Finished difference Result 144 states and 180 transitions. [2018-11-10 03:46:54,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 03:46:54,159 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-10 03:46:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:54,160 INFO L225 Difference]: With dead ends: 144 [2018-11-10 03:46:54,160 INFO L226 Difference]: Without dead ends: 134 [2018-11-10 03:46:54,161 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 03:46:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-10 03:46:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 87. [2018-11-10 03:46:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 03:46:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2018-11-10 03:46:54,172 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 65 [2018-11-10 03:46:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:54,172 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2018-11-10 03:46:54,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 03:46:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2018-11-10 03:46:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:46:54,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:54,173 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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 03:46:54,173 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:54,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:54,173 INFO L82 PathProgramCache]: Analyzing trace with hash -934621700, now seen corresponding path program 1 times [2018-11-10 03:46:54,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:54,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:54,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 03:46:54,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:54,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:46:54,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:46:54,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:46:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:46:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:46:54,204 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 4 states. [2018-11-10 03:46:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:54,228 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-11-10 03:46:54,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:46:54,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 03:46:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:54,229 INFO L225 Difference]: With dead ends: 97 [2018-11-10 03:46:54,230 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 03:46:54,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 03:46:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 03:46:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-11-10 03:46:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 03:46:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2018-11-10 03:46:54,238 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 65 [2018-11-10 03:46:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:54,239 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2018-11-10 03:46:54,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:46:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2018-11-10 03:46:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 03:46:54,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:54,240 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:54,240 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:54,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:54,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1800460031, now seen corresponding path program 1 times [2018-11-10 03:46:54,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:54,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:54,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:54,286 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-10 03:46:54,286 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [53], [59], [67], [68], [69], [72], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:54,288 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:54,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:54,295 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:54,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:46:54,478 INFO L272 AbstractInterpreter]: Visited 53 different actions 601 times. Merged at 21 different actions 396 times. Widened at 2 different actions 65 times. Found 48 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-10 03:46:54,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:54,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:46:54,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:54,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/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 03:46:54,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:54,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:46:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:54,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 03:46:54,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:46:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:54,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:46:54,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-10 03:46:54,660 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:46:54,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:46:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:46:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:46:54,661 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 5 states. [2018-11-10 03:46:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:54,719 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2018-11-10 03:46:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:46:54,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-10 03:46:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:54,721 INFO L225 Difference]: With dead ends: 160 [2018-11-10 03:46:54,721 INFO L226 Difference]: Without dead ends: 106 [2018-11-10 03:46:54,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:46:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-10 03:46:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2018-11-10 03:46:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 03:46:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2018-11-10 03:46:54,736 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 66 [2018-11-10 03:46:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:54,736 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2018-11-10 03:46:54,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:46:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2018-11-10 03:46:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 03:46:54,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:54,737 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:54,737 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:54,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1320929471, now seen corresponding path program 1 times [2018-11-10 03:46:54,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:54,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:54,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:54,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:54,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:54,800 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-10 03:46:54,800 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [31], [33], [39], [43], [49], [53], [59], [65], [67], [68], [69], [72], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:54,801 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:54,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:54,806 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:55,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:46:55,008 INFO L272 AbstractInterpreter]: Visited 54 different actions 680 times. Merged at 22 different actions 482 times. Widened at 3 different actions 105 times. Found 58 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-10 03:46:55,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:55,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:46:55,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:55,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/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 03:46:55,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:55,033 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:46:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:55,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 03:46:55,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:46:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 03:46:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:46:55,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 20 [2018-11-10 03:46:55,414 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:46:55,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 03:46:55,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:46:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:46:55,415 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 14 states. [2018-11-10 03:46:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:57,961 INFO L93 Difference]: Finished difference Result 205 states and 256 transitions. [2018-11-10 03:46:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 03:46:57,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-11-10 03:46:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:57,963 INFO L225 Difference]: With dead ends: 205 [2018-11-10 03:46:57,963 INFO L226 Difference]: Without dead ends: 150 [2018-11-10 03:46:57,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 03:46:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-10 03:46:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 98. [2018-11-10 03:46:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 03:46:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2018-11-10 03:46:57,982 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 68 [2018-11-10 03:46:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:57,983 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2018-11-10 03:46:57,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 03:46:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-11-10 03:46:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 03:46:57,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:57,984 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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 03:46:57,984 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:57,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash 925129036, now seen corresponding path program 1 times [2018-11-10 03:46:57,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:57,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:57,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:57,985 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:58,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:58,017 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:58,017 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-10 03:46:58,017 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [53], [59], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:58,018 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:58,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:58,023 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:58,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:46:58,205 INFO L272 AbstractInterpreter]: Visited 53 different actions 615 times. Merged at 21 different actions 402 times. Widened at 2 different actions 65 times. Found 48 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-10 03:46:58,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:58,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:46:58,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:58,215 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:46:58,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:58,228 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:46:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 03:46:58,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:46:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:58,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:46:58,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-10 03:46:58,376 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:46:58,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:46:58,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:46:58,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:46:58,377 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 6 states. [2018-11-10 03:46:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:58,441 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2018-11-10 03:46:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:46:58,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-10 03:46:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:58,442 INFO L225 Difference]: With dead ends: 205 [2018-11-10 03:46:58,442 INFO L226 Difference]: Without dead ends: 136 [2018-11-10 03:46:58,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:46:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-10 03:46:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 101. [2018-11-10 03:46:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 03:46:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-11-10 03:46:58,459 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 70 [2018-11-10 03:46:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:58,459 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-11-10 03:46:58,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:46:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-11-10 03:46:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 03:46:58,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:58,460 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:58,460 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:58,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash 990456522, now seen corresponding path program 1 times [2018-11-10 03:46:58,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:46:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:58,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:58,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:58,462 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:46:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:46:58,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:58,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:46:58,530 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-10 03:46:58,530 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [31], [33], [39], [43], [49], [53], [59], [65], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:46:58,533 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:46:58,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:46:58,537 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:46:58,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:46:58,742 INFO L272 AbstractInterpreter]: Visited 54 different actions 707 times. Merged at 22 different actions 494 times. Widened at 3 different actions 105 times. Found 58 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-10 03:46:58,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:58,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:46:58,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:46:58,751 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:46:58,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:58,768 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:46:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:58,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 03:46:58,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:46:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 03:46:59,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:46:59,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2018-11-10 03:46:59,334 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:46:59,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 03:46:59,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:46:59,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-11-10 03:46:59,335 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 15 states. [2018-11-10 03:47:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:00,110 INFO L93 Difference]: Finished difference Result 226 states and 284 transitions. [2018-11-10 03:47:00,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 03:47:00,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-10 03:47:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:00,112 INFO L225 Difference]: With dead ends: 226 [2018-11-10 03:47:00,112 INFO L226 Difference]: Without dead ends: 149 [2018-11-10 03:47:00,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1389, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 03:47:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-10 03:47:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 85. [2018-11-10 03:47:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 03:47:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-11-10 03:47:00,124 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 72 [2018-11-10 03:47:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:00,125 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-11-10 03:47:00,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 03:47:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-11-10 03:47:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 03:47:00,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:00,126 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:00,126 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:00,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:00,126 INFO L82 PathProgramCache]: Analyzing trace with hash -577380559, now seen corresponding path program 2 times [2018-11-10 03:47:00,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:00,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:00,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:00,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:00,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:47:00,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:00,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:00,171 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 03:47:00,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 03:47:00,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:00,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:00,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:47:00,182 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 03:47:00,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 03:47:00,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:47:00,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 03:47:00,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 03:47:00,479 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:00,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 19 [2018-11-10 03:47:00,479 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:47:00,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:47:00,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:47:00,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:47:00,480 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 8 states. [2018-11-10 03:47:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:00,646 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2018-11-10 03:47:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:47:00,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-11-10 03:47:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:00,649 INFO L225 Difference]: With dead ends: 119 [2018-11-10 03:47:00,649 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 03:47:00,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:47:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 03:47:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2018-11-10 03:47:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 03:47:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2018-11-10 03:47:00,667 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 74 [2018-11-10 03:47:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:00,668 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2018-11-10 03:47:00,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:47:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2018-11-10 03:47:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 03:47:00,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:00,669 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:00,669 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:00,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1857244237, now seen corresponding path program 2 times [2018-11-10 03:47:00,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:00,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:00,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:00,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:00,675 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:47:00,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:00,738 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:00,738 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 03:47:00,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 03:47:00,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:00,738 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:00,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:47:00,749 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 03:47:00,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 03:47:00,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:47:00,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 03:47:00,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 03:47:00,978 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:00,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 18 [2018-11-10 03:47:00,979 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:47:00,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:47:00,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:47:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-11-10 03:47:00,980 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 8 states. [2018-11-10 03:47:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:01,049 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-11-10 03:47:01,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:47:01,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-11-10 03:47:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:01,050 INFO L225 Difference]: With dead ends: 113 [2018-11-10 03:47:01,050 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 03:47:01,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:47:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 03:47:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2018-11-10 03:47:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 03:47:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-11-10 03:47:01,061 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 74 [2018-11-10 03:47:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:01,061 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-10 03:47:01,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:47:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-10 03:47:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 03:47:01,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:01,062 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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 03:47:01,062 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:01,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1913183562, now seen corresponding path program 3 times [2018-11-10 03:47:01,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:01,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:01,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:01,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:01,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:01,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:01,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:01,097 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 03:47:01,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 03:47:01,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:01,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:01,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:47:01,120 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 03:47:01,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:47:01,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:47:01,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 03:47:01,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:01,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:47:01,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-10 03:47:01,267 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:47:01,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 03:47:01,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:47:01,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:47:01,268 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 7 states. [2018-11-10 03:47:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:01,374 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2018-11-10 03:47:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:47:01,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-10 03:47:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:01,377 INFO L225 Difference]: With dead ends: 165 [2018-11-10 03:47:01,377 INFO L226 Difference]: Without dead ends: 116 [2018-11-10 03:47:01,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:47:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-10 03:47:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2018-11-10 03:47:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 03:47:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-11-10 03:47:01,394 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 79 [2018-11-10 03:47:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:01,394 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-11-10 03:47:01,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 03:47:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-11-10 03:47:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 03:47:01,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:01,395 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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] [2018-11-10 03:47:01,396 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:01,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1197805772, now seen corresponding path program 2 times [2018-11-10 03:47:01,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:01,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:01,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:01,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:01,518 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:01,518 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 03:47:01,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 03:47:01,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:01,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:01,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:47:01,528 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 03:47:01,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 03:47:01,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:47:01,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 03:47:01,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 03:47:01,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:01,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 10] total 23 [2018-11-10 03:47:01,910 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:47:01,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:47:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:47:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-11-10 03:47:01,911 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 10 states. [2018-11-10 03:47:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:02,042 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2018-11-10 03:47:02,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:47:02,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2018-11-10 03:47:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:02,045 INFO L225 Difference]: With dead ends: 132 [2018-11-10 03:47:02,045 INFO L226 Difference]: Without dead ends: 122 [2018-11-10 03:47:02,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-11-10 03:47:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-10 03:47:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2018-11-10 03:47:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 03:47:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2018-11-10 03:47:02,066 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 81 [2018-11-10 03:47:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:02,066 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2018-11-10 03:47:02,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:47:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2018-11-10 03:47:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 03:47:02,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:02,068 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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] [2018-11-10 03:47:02,068 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:02,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash -82057906, now seen corresponding path program 2 times [2018-11-10 03:47:02,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:02,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:02,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:02,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:02,069 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:02,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:02,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:02,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 03:47:02,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 03:47:02,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:02,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:47:02,176 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 03:47:02,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 03:47:02,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:47:02,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 03:47:02,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 03:47:02,854 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:02,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [8] total 29 [2018-11-10 03:47:02,854 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:47:02,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:47:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:47:02,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-11-10 03:47:02,856 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 13 states. [2018-11-10 03:47:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:03,142 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2018-11-10 03:47:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:47:03,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-11-10 03:47:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:03,144 INFO L225 Difference]: With dead ends: 134 [2018-11-10 03:47:03,144 INFO L226 Difference]: Without dead ends: 124 [2018-11-10 03:47:03,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 03:47:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-10 03:47:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2018-11-10 03:47:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 03:47:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2018-11-10 03:47:03,158 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 81 [2018-11-10 03:47:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:03,159 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2018-11-10 03:47:03,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:47:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2018-11-10 03:47:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 03:47:03,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:03,160 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 03:47:03,160 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:03,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:03,161 INFO L82 PathProgramCache]: Analyzing trace with hash 401627538, now seen corresponding path program 1 times [2018-11-10 03:47:03,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:03,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:03,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 03:47:03,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:03,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:03,222 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-11-10 03:47:03,223 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [31], [33], [39], [43], [49], [53], [55], [59], [65], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:47:03,224 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:47:03,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:47:03,228 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:47:03,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:47:03,392 INFO L272 AbstractInterpreter]: Visited 55 different actions 697 times. Merged at 22 different actions 490 times. Widened at 3 different actions 105 times. Found 63 fixpoints after 6 different actions. Largest state had 23 variables. [2018-11-10 03:47:03,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:03,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:47:03,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:03,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:03,411 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:47:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:03,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 03:47:03,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 03:47:04,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:47:04,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 14] total 28 [2018-11-10 03:47:04,063 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:47:04,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 03:47:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 03:47:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-11-10 03:47:04,063 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand 16 states. [2018-11-10 03:47:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:04,542 INFO L93 Difference]: Finished difference Result 239 states and 292 transitions. [2018-11-10 03:47:04,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 03:47:04,543 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-11-10 03:47:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:04,544 INFO L225 Difference]: With dead ends: 239 [2018-11-10 03:47:04,544 INFO L226 Difference]: Without dead ends: 148 [2018-11-10 03:47:04,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 03:47:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-10 03:47:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 103. [2018-11-10 03:47:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 03:47:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-11-10 03:47:04,563 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 81 [2018-11-10 03:47:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:04,563 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-11-10 03:47:04,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 03:47:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-11-10 03:47:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 03:47:04,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:04,565 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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 03:47:04,565 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:04,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:04,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1315823205, now seen corresponding path program 1 times [2018-11-10 03:47:04,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:04,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:04,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:04,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:04,566 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 03:47:04,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:04,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:04,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2018-11-10 03:47:04,651 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [53], [55], [59], [65], [67], [68], [69], [72], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:47:04,652 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:47:04,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:47:04,657 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:47:04,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:47:04,880 INFO L272 AbstractInterpreter]: Visited 55 different actions 603 times. Merged at 22 different actions 400 times. Widened at 2 different actions 69 times. Found 53 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 03:47:04,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:04,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:47:04,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:04,882 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:04,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:04,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:47:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:04,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 03:47:04,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 03:47:05,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:47:05,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-10 03:47:05,106 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:47:05,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:47:05,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:47:05,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:47:05,106 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 8 states. [2018-11-10 03:47:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:05,268 INFO L93 Difference]: Finished difference Result 211 states and 251 transitions. [2018-11-10 03:47:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:47:05,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-11-10 03:47:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:05,269 INFO L225 Difference]: With dead ends: 211 [2018-11-10 03:47:05,269 INFO L226 Difference]: Without dead ends: 145 [2018-11-10 03:47:05,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=119, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:47:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-10 03:47:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2018-11-10 03:47:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 03:47:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2018-11-10 03:47:05,287 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 83 [2018-11-10 03:47:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:05,287 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2018-11-10 03:47:05,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:47:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2018-11-10 03:47:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 03:47:05,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:05,288 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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 03:47:05,289 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:05,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:05,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1927329831, now seen corresponding path program 1 times [2018-11-10 03:47:05,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:05,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:05,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:05,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 03:47:05,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:05,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:05,465 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-11-10 03:47:05,466 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [31], [33], [39], [43], [49], [53], [55], [59], [65], [67], [68], [69], [72], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:47:05,467 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:47:05,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:47:05,471 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:47:05,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:47:05,721 INFO L272 AbstractInterpreter]: Visited 55 different actions 683 times. Merged at 22 different actions 484 times. Widened at 3 different actions 105 times. Found 63 fixpoints after 6 different actions. Largest state had 23 variables. [2018-11-10 03:47:05,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:05,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:47:05,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:05,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/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 03:47:05,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:05,746 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:47:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:05,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 03:47:06,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 03:47:06,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:47:06,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2018-11-10 03:47:06,317 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:47:06,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 03:47:06,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 03:47:06,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-11-10 03:47:06,318 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 17 states. [2018-11-10 03:47:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:06,793 INFO L93 Difference]: Finished difference Result 224 states and 265 transitions. [2018-11-10 03:47:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 03:47:06,793 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-11-10 03:47:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:06,794 INFO L225 Difference]: With dead ends: 224 [2018-11-10 03:47:06,794 INFO L226 Difference]: Without dead ends: 147 [2018-11-10 03:47:06,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 153 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 03:47:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-10 03:47:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2018-11-10 03:47:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 03:47:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-11-10 03:47:06,813 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 85 [2018-11-10 03:47:06,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:06,813 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2018-11-10 03:47:06,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 03:47:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2018-11-10 03:47:06,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 03:47:06,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:06,814 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 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 03:47:06,815 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:06,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:06,815 INFO L82 PathProgramCache]: Analyzing trace with hash -169429374, now seen corresponding path program 1 times [2018-11-10 03:47:06,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:06,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:06,816 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 65 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:06,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:06,877 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:06,877 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-11-10 03:47:06,877 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [55], [65], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:47:06,878 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:47:06,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:47:06,883 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:47:07,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:47:07,035 INFO L272 AbstractInterpreter]: Visited 53 different actions 485 times. Merged at 21 different actions 312 times. Widened at 2 different actions 52 times. Found 37 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-10 03:47:07,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:07,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:47:07,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:07,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:07,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:07,061 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:47:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:07,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 55 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 03:47:07,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 65 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:07,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:47:07,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-10 03:47:07,274 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:47:07,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:47:07,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:47:07,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-11-10 03:47:07,275 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 9 states. [2018-11-10 03:47:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:07,389 INFO L93 Difference]: Finished difference Result 211 states and 243 transitions. [2018-11-10 03:47:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:47:07,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-11-10 03:47:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:07,392 INFO L225 Difference]: With dead ends: 211 [2018-11-10 03:47:07,392 INFO L226 Difference]: Without dead ends: 151 [2018-11-10 03:47:07,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=153, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:47:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-10 03:47:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2018-11-10 03:47:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-10 03:47:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-11-10 03:47:07,412 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 87 [2018-11-10 03:47:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:07,413 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-11-10 03:47:07,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:47:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-11-10 03:47:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 03:47:07,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:07,414 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 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] [2018-11-10 03:47:07,414 INFO L424 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:07,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:07,414 INFO L82 PathProgramCache]: Analyzing trace with hash 355669636, now seen corresponding path program 1 times [2018-11-10 03:47:07,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:47:07,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:07,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:07,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:07,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:47:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 4 proven. 72 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:07,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:07,533 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:47:07,534 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2018-11-10 03:47:07,534 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [31], [33], [39], [43], [49], [55], [65], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 03:47:07,537 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:47:07,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:47:07,542 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:47:07,696 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:47:07,696 INFO L272 AbstractInterpreter]: Visited 53 different actions 568 times. Merged at 21 different actions 398 times. Widened at 3 different actions 90 times. Found 48 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-10 03:47:07,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:07,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:47:07,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:07,707 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/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 03:47:07,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:07,726 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:47:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:07,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 03:47:07,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:47:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 03:47:08,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:47:08,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 25 [2018-11-10 03:47:08,174 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:47:08,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 03:47:08,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 03:47:08,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-11-10 03:47:08,175 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 18 states. [2018-11-10 03:47:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:11,236 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2018-11-10 03:47:11,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 03:47:11,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-11-10 03:47:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:11,236 INFO L225 Difference]: With dead ends: 207 [2018-11-10 03:47:11,236 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:47:11,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 03:47:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:47:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:47:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:47:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:47:11,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2018-11-10 03:47:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:11,238 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:47:11,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 03:47:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:47:11,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:47:11,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:47:12,142 WARN L179 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2018-11-10 03:47:12,658 WARN L179 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2018-11-10 03:47:12,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:12,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:12,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:12,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:12,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:12,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:12,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:12,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:12,936 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 121 [2018-11-10 03:47:13,081 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 136 [2018-11-10 03:47:13,345 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 149 [2018-11-10 03:47:13,576 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 148 [2018-11-10 03:47:13,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:13,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:13,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:14,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:47:14,333 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2018-11-10 03:47:14,611 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 109 [2018-11-10 03:47:15,980 WARN L179 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 199 DAG size of output: 41 [2018-11-10 03:47:17,454 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 279 DAG size of output: 39 [2018-11-10 03:47:17,676 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 39 [2018-11-10 03:47:17,874 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 49 [2018-11-10 03:47:18,975 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 187 DAG size of output: 49 [2018-11-10 03:47:19,016 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 03:47:19,017 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:47:19,017 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:47:19,017 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 03:47:19,017 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:47:19,017 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:47:19,017 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 42) no Hoare annotation was computed. [2018-11-10 03:47:19,017 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-10 03:47:19,017 INFO L425 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-10 03:47:19,017 INFO L421 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (let ((.cse1 (* 2 base2flt_~e)) (.cse0 (not (= |base2flt_#in~e| 0)))) (and (or .cse0 (<= .cse1 0) (not (= |base2flt_#in~m| 1))) (let ((.cse2 (* 2 |base2flt_#in~e|))) (or (and (<= 0 (+ .cse1 256)) (<= .cse1 254)) (< (+ .cse2 256) 0) (< 254 .cse2))) (let ((.cse3 (* 2 |base2flt_#in~m|))) (or (and (= base2flt_~e 0) (= base2flt_~m 0) (= base2flt_~__retres4~0 0)) .cse0 (< .cse3 0) (< 0 .cse3))))) [2018-11-10 03:47:19,017 INFO L425 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-10 03:47:19,018 INFO L425 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-10 03:47:19,018 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-10 03:47:19,018 INFO L421 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0))) (.cse1 (* 2 base2flt_~e))) (and (or .cse0 (and (<= (+ base2flt_~e 1) base2flt_~m) (= base2flt_~e 0) (<= (+ base2flt_~e base2flt_~m) 1)) (not (= |base2flt_#in~m| 1)) (and (<= (+ .cse1 2) 0) (= (mod base2flt_~m 2) 0) (<= 4 (* 2 base2flt_~m)))) (let ((.cse2 (* 2 |base2flt_#in~m|))) (or .cse0 (< .cse2 0) (< 0 .cse2))) (let ((.cse3 (* 2 |base2flt_#in~e|))) (or (and (<= 0 (+ .cse1 256)) (not (= base2flt_~m 0)) (<= .cse1 254)) (< (+ .cse3 256) 0) (< 254 .cse3))))) [2018-11-10 03:47:19,018 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-10 03:47:19,018 INFO L428 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-10 03:47:19,018 INFO L425 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-10 03:47:19,018 INFO L421 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0))) (.cse1 (* 2 base2flt_~e))) (and (or (not (= |base2flt_#in~m| 1)) .cse0 (and (<= (+ .cse1 2) 0) (= (mod base2flt_~m 2) 0) (<= 4 (* 2 base2flt_~m)))) (let ((.cse2 (* 2 |base2flt_#in~m|))) (or .cse0 (< .cse2 0) (< 0 .cse2))) (let ((.cse3 (* 2 |base2flt_#in~e|))) (or (< (+ .cse3 256) 0) (< 254 .cse3) (and (<= 0 (+ .cse1 256)) (<= .cse1 254)))))) [2018-11-10 03:47:19,018 INFO L425 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-10 03:47:19,018 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 62) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 62) the Hoare annotation is: (let ((.cse0 (* 2 |base2flt_#in~e|))) (or (< (+ .cse0 256) 0) (and (and (or (<= 4194304 |base2flt_#in~m|) (<= (+ |base2flt_#in~m| 1) 0)) (<= (* 2 base2flt_~e) 254)) (<= |base2flt_#in~e| base2flt_~e)) (< 254 .cse0))) [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L428 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-10 03:47:19,019 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L421 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (and (or (let ((.cse0 (* 2 mulflt_~__retres10~1))) (and (<= .cse0 0) (<= 0 .cse0))) (let ((.cse1 (mod |mulflt_#in~a| 4294967296)) (.cse4 (= mulflt_~a |mulflt_#in~a|))) (let ((.cse3 (or (and (= mulflt_~b |mulflt_#in~a|) (not (= .cse1 0))) (and (exists ((mulflt_~b Int)) (let ((.cse5 (mod mulflt_~b 4294967296))) (and (<= .cse5 (mod |mulflt_#in~a| 4294967296)) (not (= .cse5 0))))) (<= (mod mulflt_~b 4294967296) .cse1) .cse4))) (.cse2 (mod |mulflt_#in~b| 4294967296))) (or (and (< .cse1 .cse2) .cse3) (and .cse3 .cse4 (= mulflt_~b |mulflt_#in~b|) (not (= 0 .cse2))))))) (or (and (= mulflt_~b 0) (<= mulflt_~a mulflt_~b) (<= mulflt_~b mulflt_~a)) (not (= |mulflt_#in~b| 0)) (< 0 (+ |mulflt_#in~b| |mulflt_#in~a|)) (< (* 2 |mulflt_#in~a|) 0))) [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-10 03:47:19,020 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-10 03:47:19,021 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (and (<= 0 (+ (* 2 main_~eb~2) 256)) (<= (+ main_~ea~2 main_~zero~0) 127) (<= main_~eb~2 (+ main_~zero~0 127)) (= main_~zero~0 0) (<= main_~zero~0 (+ main_~ea~2 128))) [2018-11-10 03:47:19,021 INFO L425 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-10 03:47:19,021 INFO L421 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: (let ((.cse0 (* 2 main_~eb~2)) (.cse1 (* 2 main_~ea~2))) (and (<= .cse0 254) (<= 0 (+ .cse1 256)) (<= 0 (+ .cse0 256)) (<= .cse1 254))) [2018-11-10 03:47:19,021 INFO L425 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-10 03:47:19,021 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-10 03:47:19,021 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-10 03:47:19,021 INFO L421 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (let ((.cse0 (* 2 main_~tmp___1~0)) (.cse1 (* 2 main_~tmp___0~0))) (and (<= 0 .cse0) (<= 0 (+ (* 2 main_~eb~2) 256)) (<= .cse0 0) (<= (+ main_~ea~2 main_~zero~0) 127) (<= main_~eb~2 (+ main_~zero~0 127)) (<= 0 .cse1) (= main_~zero~0 0) (<= .cse1 0) (<= main_~zero~0 (+ main_~ea~2 128)))) [2018-11-10 03:47:19,021 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-10 03:47:19,021 INFO L421 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (and (<= 0 (+ (* 2 main_~eb~2) 256)) (<= (+ main_~ea~2 main_~zero~0) 127) (<= main_~eb~2 (+ main_~zero~0 127)) (= main_~zero~0 0) (<= main_~zero~0 (+ main_~ea~2 128))) [2018-11-10 03:47:19,021 INFO L421 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (let ((.cse1 (<= main_~zero~0 (+ main_~ea~2 128))) (.cse3 (<= main_~eb~2 (+ main_~zero~0 127))) (.cse4 (<= (* 2 main_~tmp~2) 0)) (.cse0 (<= 0 (+ (* 2 main_~eb~2) 256))) (.cse5 (<= main_~zero~0 main_~tmp~2)) (.cse2 (<= (+ main_~ea~2 main_~zero~0) 127)) (.cse6 (<= main_~sa~0 main_~zero~0))) (or (and (<= 1 main_~tmp~2) .cse0 .cse1 .cse2 .cse3 (<= 1 main_~sa~0) (= main_~zero~0 0)) (<= (+ main_~sa~0 1) 0) (and .cse1 .cse3 .cse4 .cse0 (<= (mod main_~a~0 4294967296) 0) .cse5 .cse2 .cse6) (and .cse1 .cse3 .cse4 .cse0 .cse5 (= main_~b~0 0) .cse2 .cse6))) [2018-11-10 03:47:19,022 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-10 03:47:19,022 INFO L421 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (and (<= 0 (+ (* 2 main_~eb~2) 256)) (<= (+ main_~ea~2 main_~zero~0) 127) (<= main_~eb~2 (+ main_~zero~0 127)) (= main_~zero~0 0) (<= main_~zero~0 (+ main_~ea~2 128))) [2018-11-10 03:47:19,022 INFO L425 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-10 03:47:19,022 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-10 03:47:19,022 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-10 03:47:19,022 INFO L425 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-10 03:47:19,022 INFO L425 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-10 03:47:19,022 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-10 03:47:19,022 INFO L425 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-10 03:47:19,035 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,036 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,037 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,037 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,038 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,043 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,044 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,044 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:47:19 BoogieIcfgContainer [2018-11-10 03:47:19,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:47:19,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:47:19,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:47:19,048 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:47:19,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:46:31" (3/4) ... [2018-11-10 03:47:19,052 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:47:19,057 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:47:19,057 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-10 03:47:19,057 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-10 03:47:19,058 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:47:19,058 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 03:47:19,062 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-10 03:47:19,062 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 03:47:19,062 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 03:47:19,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(e) == 0) || 2 * e <= 0) || !(\old(m) == 1)) && (((0 <= 2 * e + 256 && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e))) && (((((e == 0 && m == 0) && __retres4 == 0) || !(\old(e) == 0)) || 2 * \old(m) < 0) || 0 < 2 * \old(m)) [2018-11-10 03:47:19,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(e) == 0) || ((e + 1 <= m && e == 0) && e + m <= 1)) || !(\old(m) == 1)) || ((2 * e + 2 <= 0 && m % 2 == 0) && 4 <= 2 * m)) && ((!(\old(e) == 0) || 2 * \old(m) < 0) || 0 < 2 * \old(m))) && ((((0 <= 2 * e + 256 && !(m == 0)) && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e)) [2018-11-10 03:47:19,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (2 * \old(e) + 256 < 0 || (((4194304 <= \old(m) || \old(m) + 1 <= 0) && 2 * e <= 254) && \old(e) <= e)) || 254 < 2 * \old(e) [2018-11-10 03:47:19,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(m) == 1) || !(\old(e) == 0)) || ((2 * e + 2 <= 0 && m % 2 == 0) && 4 <= 2 * m)) && ((!(\old(e) == 0) || 2 * \old(m) < 0) || 0 < 2 * \old(m))) && ((2 * \old(e) + 256 < 0 || 254 < 2 * \old(e)) || (0 <= 2 * e + 256 && 2 * e <= 254)) [2018-11-10 03:47:19,083 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((2 * __retres10 <= 0 && 0 <= 2 * __retres10) || (\old(a) % 4294967296 < \old(b) % 4294967296 && ((b == \old(a) && !(\old(a) % 4294967296 == 0)) || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a)))) || (((((b == \old(a) && !(\old(a) % 4294967296 == 0)) || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a))) && a == \old(a)) && b == \old(b)) && !(0 == \old(b) % 4294967296))) && (((((b == 0 && a <= b) && b <= a) || !(\old(b) == 0)) || 0 < \old(b) + \old(a)) || 2 * \old(a) < 0) [2018-11-10 03:47:19,107 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7580092e-8de5-4b4d-8d8f-4b4bc040faf2/bin-2019/utaipan/witness.graphml [2018-11-10 03:47:19,107 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:47:19,108 INFO L168 Benchmark]: Toolchain (without parser) took 47972.38 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 635.4 MB). Free memory was 953.8 MB in the beginning and 1.4 GB in the end (delta: -490.7 MB). Peak memory consumption was 144.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:19,108 INFO L168 Benchmark]: CDTParser took 0.20 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 03:47:19,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.20 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:19,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.64 ms. Allocated memory is still 1.0 GB. Free memory was 940.4 MB in the beginning and 937.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:19,109 INFO L168 Benchmark]: Boogie Preprocessor took 73.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -207.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:19,110 INFO L168 Benchmark]: RCFGBuilder took 324.48 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: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:19,110 INFO L168 Benchmark]: TraceAbstraction took 47263.71 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 495.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -343.8 MB). Peak memory consumption was 746.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:19,110 INFO L168 Benchmark]: Witness Printer took 59.34 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:19,112 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 225.20 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.64 ms. Allocated memory is still 1.0 GB. Free memory was 940.4 MB in the beginning and 937.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -207.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.48 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: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47263.71 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 495.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -343.8 MB). Peak memory consumption was 746.9 MB. Max. memory is 11.5 GB. * Witness Printer took 59.34 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((!(\old(m) == 1) || !(\old(e) == 0)) || ((2 * e + 2 <= 0 && m % 2 == 0) && 4 <= 2 * m)) && ((!(\old(e) == 0) || 2 * \old(m) < 0) || 0 < 2 * \old(m))) && ((2 * \old(e) + 256 < 0 || 254 < 2 * \old(e)) || (0 <= 2 * e + 256 && 2 * e <= 254)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((!(\old(e) == 0) || 2 * e <= 0) || !(\old(m) == 1)) && (((0 <= 2 * e + 256 && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e))) && (((((e == 0 && m == 0) && __retres4 == 0) || !(\old(e) == 0)) || 2 * \old(m) < 0) || 0 < 2 * \old(m)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (2 * \old(e) + 256 < 0 || (((4194304 <= \old(m) || \old(m) + 1 <= 0) && 2 * e <= 254) && \old(e) <= e)) || 254 < 2 * \old(e) - InvariantResult [Line: 147]: Loop Invariant [2018-11-10 03:47:19,117 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-11-10 03:47:19,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] Derived loop invariant: ((2 * __retres10 <= 0 && 0 <= 2 * __retres10) || (\old(a) % 4294967296 < \old(b) % 4294967296 && ((b == \old(a) && !(\old(a) % 4294967296 == 0)) || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a)))) || (((((b == \old(a) && !(\old(a) % 4294967296 == 0)) || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && b % 4294967296 <= \old(a) % 4294967296) && a == \old(a))) && a == \old(a)) && b == \old(b)) && !(0 == \old(b) % 4294967296))) && (((((b == 0 && a <= b) && b <= a) || !(\old(b) == 0)) || 0 < \old(b) + \old(a)) || 2 * \old(a) < 0) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((!(\old(e) == 0) || ((e + 1 <= m && e == 0) && e + m <= 1)) || !(\old(m) == 1)) || ((2 * e + 2 <= 0 && m % 2 == 0) && 4 <= 2 * m)) && ((!(\old(e) == 0) || 2 * \old(m) < 0) || 0 < 2 * \old(m))) && ((((0 <= 2 * e + 256 && !(m == 0)) && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. SAFE Result, 47.1s OverallTime, 24 OverallIterations, 6 TraceHistogramMax, 25.2s AutomataDifference, 0.0s DeadEndRemovalTime, 7.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1564 SDtfs, 1746 SDslu, 13488 SDs, 0 SdLazy, 3979 SolverSat, 347 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 2994 GetRequests, 2335 SyntacticMatches, 23 SemanticMatches, 636 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.8s AbstIntTime, 17 AbstIntIterations, 8 AbstIntStrong, 0.9241396315943794 AbsIntWeakeningRatio, 1.3240343347639485 AbsIntAvgWeakeningVarsNumRemoved, 22.628755364806867 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 595 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 303 PreInvPairs, 641 NumberOfFragments, 674 HoareAnnotationTreeSize, 303 FomulaSimplifications, 7274835332 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2607299877 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2767 NumberOfCodeBlocks, 2607 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3805 ConstructedInterpolants, 106 QuantifiedInterpolants, 736336 SizeOfPredicates, 62 NumberOfNonLiveVariables, 2345 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 52 InterpolantComputations, 9 PerfectInterpolantSequences, 1855/2835 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...