./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.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_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:27:33,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:27:33,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:27:33,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:27:33,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:27:33,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:27:33,484 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:27:33,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:27:33,486 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:27:33,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:27:33,487 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:27:33,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:27:33,488 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:27:33,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:27:33,489 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:27:33,490 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:27:33,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:27:33,491 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:27:33,493 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:27:33,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:27:33,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:27:33,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:27:33,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:27:33,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:27:33,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:27:33,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:27:33,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:27:33,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:27:33,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:27:33,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:27:33,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:27:33,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:27:33,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:27:33,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:27:33,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:27:33,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:27:33,501 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:27:33,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:27:33,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:27:33,509 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:27:33,509 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:27:33,509 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:27:33,510 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:27:33,510 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:27:33,510 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:27:33,510 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:27:33,510 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:27:33,510 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:27:33,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:27:33,511 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:27:33,511 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:27:33,511 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:27:33,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:27:33,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:27:33,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:27:33,512 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:27:33,512 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:27:33,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:27:33,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:27:33,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:27:33,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:27:33,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:27:33,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:27:33,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:27:33,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:27:33,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:27:33,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:27:33,513 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:27:33,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:27:33,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:27:33,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:27:33,513 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_0225129b-f9de-4dec-829d-6e69fd798eed/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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2018-11-10 13:27:33,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:27:33,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:27:33,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:27:33,551 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:27:33,551 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:27:33,552 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-10 13:27:33,594 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/data/42fc64cde/418109d1c22d4401886df0ff85de50d4/FLAGb1abe894c [2018-11-10 13:27:34,027 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:27:34,028 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-10 13:27:34,036 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/data/42fc64cde/418109d1c22d4401886df0ff85de50d4/FLAGb1abe894c [2018-11-10 13:27:34,046 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/data/42fc64cde/418109d1c22d4401886df0ff85de50d4 [2018-11-10 13:27:34,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:27:34,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:27:34,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:27:34,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:27:34,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:27:34,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b52ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34, skipping insertion in model container [2018-11-10 13:27:34,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:27:34,088 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:27:34,260 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:27:34,264 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:27:34,313 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:27:34,325 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:27:34,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34 WrapperNode [2018-11-10 13:27:34,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:27:34,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:27:34,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:27:34,328 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:27:34,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:27:34,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:27:34,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:27:34,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:27:34,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... [2018-11-10 13:27:34,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:27:34,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:27:34,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:27:34,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:27:34,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:27:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:27:34,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:27:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:27:34,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:27:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:27:34,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:27:35,044 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:27:35,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:35 BoogieIcfgContainer [2018-11-10 13:27:35,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:27:35,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:27:35,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:27:35,047 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:27:35,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:27:34" (1/3) ... [2018-11-10 13:27:35,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f05944c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:27:35, skipping insertion in model container [2018-11-10 13:27:35,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:34" (2/3) ... [2018-11-10 13:27:35,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f05944c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:27:35, skipping insertion in model container [2018-11-10 13:27:35,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:35" (3/3) ... [2018-11-10 13:27:35,050 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-10 13:27:35,056 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:27:35,061 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:27:35,070 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:27:35,092 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:27:35,092 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:27:35,092 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:27:35,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:27:35,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:27:35,093 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:27:35,093 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:27:35,093 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:27:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-10 13:27:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 13:27:35,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:35,109 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:35,111 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:35,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:35,115 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-11-10 13:27:35,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:35,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:35,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:27:35,213 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:35,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:27:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:27:35,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:27:35,225 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-10 13:27:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:35,250 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-10 13:27:35,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:27:35,251 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-10 13:27:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:35,259 INFO L225 Difference]: With dead ends: 222 [2018-11-10 13:27:35,259 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 13:27:35,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:27:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 13:27:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-10 13:27:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-10 13:27:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-10 13:27:35,291 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-10 13:27:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:35,291 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-10 13:27:35,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:27:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-10 13:27:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 13:27:35,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:35,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:35,293 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:35,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:35,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-11-10 13:27:35,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:35,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:35,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,295 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:35,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:35,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:27:35,333 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:35,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:35,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:35,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:35,334 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-10 13:27:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:35,397 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-10 13:27:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:35,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 13:27:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:35,399 INFO L225 Difference]: With dead ends: 205 [2018-11-10 13:27:35,399 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 13:27:35,400 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 13:27:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 13:27:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-10 13:27:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 13:27:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-10 13:27:35,408 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-10 13:27:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:35,408 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-10 13:27:35,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-10 13:27:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 13:27:35,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:35,409 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:35,409 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:35,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-11-10 13:27:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:35,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:35,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:27:35,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:35,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:35,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:35,506 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-11-10 13:27:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:35,620 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-10 13:27:35,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:35,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 13:27:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:35,622 INFO L225 Difference]: With dead ends: 209 [2018-11-10 13:27:35,622 INFO L226 Difference]: Without dead ends: 190 [2018-11-10 13:27:35,623 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 13:27:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-10 13:27:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-10 13:27:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-10 13:27:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-10 13:27:35,633 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-10 13:27:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:35,633 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-10 13:27:35,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-10 13:27:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 13:27:35,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:35,634 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:35,634 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:35,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-11-10 13:27:35,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:35,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:35,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:35,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:35,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:27:35,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:35,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:35,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:35,673 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-10 13:27:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:35,705 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-10 13:27:35,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:35,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 13:27:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:35,706 INFO L225 Difference]: With dead ends: 297 [2018-11-10 13:27:35,706 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 13:27:35,707 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 13:27:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 13:27:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-10 13:27:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 13:27:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-10 13:27:35,714 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-10 13:27:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:35,715 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-10 13:27:35,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-10 13:27:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 13:27:35,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:35,716 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:35,716 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:35,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-11-10 13:27:35,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:35,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:35,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:27:35,773 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:35,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:35,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:35,774 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-10 13:27:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:35,792 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-10 13:27:35,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:35,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 13:27:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:35,794 INFO L225 Difference]: With dead ends: 230 [2018-11-10 13:27:35,794 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 13:27:35,794 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 13:27:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 13:27:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-10 13:27:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-10 13:27:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-10 13:27:35,800 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-10 13:27:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:35,800 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-10 13:27:35,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-10 13:27:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 13:27:35,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:35,802 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 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 13:27:35,802 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:35,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:35,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-11-10 13:27:35,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:35,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:35,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:35,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:35,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:35,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:35,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-10 13:27:35,874 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [233], [236], [239], [520], [523], [524], [525] [2018-11-10 13:27:35,907 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:35,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:36,379 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:37,616 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:27:37,617 INFO L272 AbstractInterpreter]: Visited 23 different actions 47 times. Merged at 15 different actions 19 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-11-10 13:27:37,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:37,624 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:27:37,998 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 91.92% of their original sizes. [2018-11-10 13:27:37,998 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:27:38,148 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-11-10 13:27:38,148 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:27:38,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:38,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-11-10 13:27:38,149 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:38,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:27:38,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:27:38,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:27:38,149 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 13 states. [2018-11-10 13:27:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:40,944 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2018-11-10 13:27:40,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:27:40,945 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-10 13:27:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:40,946 INFO L225 Difference]: With dead ends: 225 [2018-11-10 13:27:40,946 INFO L226 Difference]: Without dead ends: 141 [2018-11-10 13:27:40,947 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:27:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-10 13:27:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-11-10 13:27:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 13:27:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2018-11-10 13:27:40,957 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 27 [2018-11-10 13:27:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:40,957 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2018-11-10 13:27:40,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:27:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2018-11-10 13:27:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 13:27:40,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:40,958 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:40,958 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:40,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:40,959 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-11-10 13:27:40,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:41,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:41,056 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:41,056 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-10 13:27:41,056 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [261], [276], [291], [294], [297], [300], [520], [523], [524], [525] [2018-11-10 13:27:41,058 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:41,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:41,336 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:42,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:27:42,701 INFO L272 AbstractInterpreter]: Visited 28 different actions 57 times. Merged at 21 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 43 variables. [2018-11-10 13:27:42,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:42,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:27:42,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:42,708 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:27:42,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:42,733 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:27:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:42,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:27:42,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:27:42,936 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:42,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-10 13:27:42,937 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:42,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:42,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:42,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:27:42,937 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand 3 states. [2018-11-10 13:27:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:42,962 INFO L93 Difference]: Finished difference Result 138 states and 204 transitions. [2018-11-10 13:27:42,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:42,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 13:27:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:42,963 INFO L225 Difference]: With dead ends: 138 [2018-11-10 13:27:42,963 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 13:27:42,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:27:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 13:27:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-11-10 13:27:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 13:27:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2018-11-10 13:27:42,974 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 31 [2018-11-10 13:27:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:42,974 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2018-11-10 13:27:42,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2018-11-10 13:27:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 13:27:42,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:42,975 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:27:42,975 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:42,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-11-10 13:27:42,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:42,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:42,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:42,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:42,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:27:43,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:43,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:27:43,010 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:43,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:43,011 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand 3 states. [2018-11-10 13:27:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:43,038 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2018-11-10 13:27:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:43,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 13:27:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:43,039 INFO L225 Difference]: With dead ends: 218 [2018-11-10 13:27:43,039 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 13:27:43,040 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 13:27:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 13:27:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-10 13:27:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 13:27:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2018-11-10 13:27:43,048 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 36 [2018-11-10 13:27:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:43,049 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2018-11-10 13:27:43,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2018-11-10 13:27:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 13:27:43,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:43,050 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:27:43,050 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:43,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-11-10 13:27:43,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:43,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:43,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 13:27:43,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:43,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:43,110 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-10 13:27:43,110 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [520], [523], [524], [525] [2018-11-10 13:27:43,113 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:43,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:43,498 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:50,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:27:50,690 INFO L272 AbstractInterpreter]: Visited 30 different actions 136 times. Merged at 23 different actions 88 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 41 variables. [2018-11-10 13:27:50,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:50,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:27:50,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:50,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:27:50,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:50,726 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:27:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:50,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 13:27:50,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 13:27:50,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:50,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-10 13:27:50,961 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:50,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:27:50,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:27:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:27:50,962 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. Second operand 5 states. [2018-11-10 13:27:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:51,122 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2018-11-10 13:27:51,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:27:51,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-10 13:27:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:51,124 INFO L225 Difference]: With dead ends: 194 [2018-11-10 13:27:51,124 INFO L226 Difference]: Without dead ends: 188 [2018-11-10 13:27:51,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:27:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-10 13:27:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2018-11-10 13:27:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 13:27:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 269 transitions. [2018-11-10 13:27:51,133 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 269 transitions. Word has length 37 [2018-11-10 13:27:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:51,133 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 269 transitions. [2018-11-10 13:27:51,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:27:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 269 transitions. [2018-11-10 13:27:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 13:27:51,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:51,134 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:27:51,135 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:51,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1280054677, now seen corresponding path program 1 times [2018-11-10 13:27:51,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:51,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:51,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:51,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:51,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 13:27:51,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:51,192 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:51,192 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-10 13:27:51,192 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [344], [347], [350], [520], [523], [524], [525] [2018-11-10 13:27:51,194 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:51,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:51,595 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:57,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:27:57,105 INFO L272 AbstractInterpreter]: Visited 31 different actions 139 times. Merged at 24 different actions 89 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 42 variables. [2018-11-10 13:27:57,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:57,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:27:57,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:57,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:27:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:57,136 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:27:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:57,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 13:27:57,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:57,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:57,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2018-11-10 13:27:57,274 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:57,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:27:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:27:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:27:57,275 INFO L87 Difference]: Start difference. First operand 179 states and 269 transitions. Second operand 5 states. [2018-11-10 13:27:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:57,452 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2018-11-10 13:27:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:27:57,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 13:27:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:57,453 INFO L225 Difference]: With dead ends: 268 [2018-11-10 13:27:57,453 INFO L226 Difference]: Without dead ends: 254 [2018-11-10 13:27:57,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:27:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-10 13:27:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-11-10 13:27:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 13:27:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2018-11-10 13:27:57,463 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 38 [2018-11-10 13:27:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:57,464 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2018-11-10 13:27:57,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:27:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2018-11-10 13:27:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 13:27:57,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:57,464 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:27:57,465 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:27:57,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:57,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-11-10 13:27:57,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:57,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:57,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:57,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:57,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:57,579 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:57,579 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-10 13:27:57,580 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [520], [523], [524], [525] [2018-11-10 13:27:57,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:57,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:57,998 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:28:03,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:28:03,682 INFO L272 AbstractInterpreter]: Visited 33 different actions 148 times. Merged at 26 different actions 97 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 44 variables. [2018-11-10 13:28:03,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:03,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:28:03,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:03,704 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:28:03,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:03,709 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:28:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:03,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:28:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:28:03,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:28:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:28:04,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:28:04,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-11-10 13:28:04,094 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:28:04,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:28:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:28:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:28:04,094 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 6 states. [2018-11-10 13:28:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:04,163 INFO L93 Difference]: Finished difference Result 260 states and 381 transitions. [2018-11-10 13:28:04,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:28:04,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-10 13:28:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:04,165 INFO L225 Difference]: With dead ends: 260 [2018-11-10 13:28:04,165 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 13:28:04,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:28:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 13:28:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-11-10 13:28:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-10 13:28:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2018-11-10 13:28:04,174 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 40 [2018-11-10 13:28:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:04,174 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2018-11-10 13:28:04,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:28:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2018-11-10 13:28:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 13:28:04,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:04,175 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:28:04,175 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:04,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-11-10 13:28:04,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:04,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:04,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:28:04,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:04,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:28:04,195 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:04,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:28:04,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:28:04,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:04,195 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand 3 states. [2018-11-10 13:28:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:04,215 INFO L93 Difference]: Finished difference Result 440 states and 652 transitions. [2018-11-10 13:28:04,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:28:04,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-10 13:28:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:04,216 INFO L225 Difference]: With dead ends: 440 [2018-11-10 13:28:04,216 INFO L226 Difference]: Without dead ends: 235 [2018-11-10 13:28:04,217 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 13:28:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-10 13:28:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-11-10 13:28:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 13:28:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 336 transitions. [2018-11-10 13:28:04,223 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 336 transitions. Word has length 41 [2018-11-10 13:28:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:04,223 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 336 transitions. [2018-11-10 13:28:04,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:28:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 336 transitions. [2018-11-10 13:28:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 13:28:04,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:04,224 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:04,224 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:04,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-11-10 13:28:04,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:04,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:04,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:28:04,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:04,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:28:04,260 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:04,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:28:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:28:04,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:04,261 INFO L87 Difference]: Start difference. First operand 233 states and 336 transitions. Second operand 3 states. [2018-11-10 13:28:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:04,281 INFO L93 Difference]: Finished difference Result 318 states and 458 transitions. [2018-11-10 13:28:04,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:28:04,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-10 13:28:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:04,283 INFO L225 Difference]: With dead ends: 318 [2018-11-10 13:28:04,283 INFO L226 Difference]: Without dead ends: 150 [2018-11-10 13:28:04,283 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 13:28:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-10 13:28:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-10 13:28:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-10 13:28:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2018-11-10 13:28:04,288 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 50 [2018-11-10 13:28:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:04,288 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2018-11-10 13:28:04,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:28:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2018-11-10 13:28:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 13:28:04,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:04,289 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2018-11-10 13:28:04,289 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:04,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-11-10 13:28:04,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:04,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:04,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 13:28:04,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:04,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:28:04,346 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-10 13:28:04,347 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [520], [523], [524], [525] [2018-11-10 13:28:04,348 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:28:04,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:28:04,559 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:28:11,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:28:11,072 INFO L272 AbstractInterpreter]: Visited 39 different actions 211 times. Merged at 32 different actions 142 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2018-11-10 13:28:11,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:11,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:28:11,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:11,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:28:11,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:11,083 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:28:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:11,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:28:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:28:11,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:28:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:28:11,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:28:11,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-11-10 13:28:11,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:28:11,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:28:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:28:11,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:28:11,234 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand 9 states. [2018-11-10 13:28:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:11,313 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2018-11-10 13:28:11,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:28:11,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-10 13:28:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:11,314 INFO L225 Difference]: With dead ends: 191 [2018-11-10 13:28:11,314 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 13:28:11,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:28:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 13:28:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-11-10 13:28:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-10 13:28:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2018-11-10 13:28:11,321 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 51 [2018-11-10 13:28:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:11,321 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2018-11-10 13:28:11,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:28:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-11-10 13:28:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 13:28:11,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:11,322 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 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] [2018-11-10 13:28:11,322 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:11,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:11,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-11-10 13:28:11,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:11,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:11,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:28:11,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:11,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:28:11,448 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-10 13:28:11,448 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [48], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-10 13:28:11,450 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:28:11,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:28:11,677 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:29:56,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:29:56,289 INFO L272 AbstractInterpreter]: Visited 44 different actions 2796 times. Merged at 37 different actions 2398 times. Widened at 5 different actions 158 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-11-10 13:29:56,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:56,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:29:56,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:29:56,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:29:56,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:56,296 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:29:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:56,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:29:56,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:29:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:29:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:29:56,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-11-10 13:29:56,982 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:29:56,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:29:56,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:29:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:29:56,983 INFO L87 Difference]: Start difference. First operand 184 states and 258 transitions. Second operand 9 states. [2018-11-10 13:29:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:29:57,267 INFO L93 Difference]: Finished difference Result 188 states and 262 transitions. [2018-11-10 13:29:57,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:29:57,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-10 13:29:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:29:57,268 INFO L225 Difference]: With dead ends: 188 [2018-11-10 13:29:57,269 INFO L226 Difference]: Without dead ends: 186 [2018-11-10 13:29:57,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-10 13:29:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-10 13:29:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-11-10 13:29:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 13:29:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2018-11-10 13:29:57,278 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 61 [2018-11-10 13:29:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:29:57,278 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2018-11-10 13:29:57,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:29:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2018-11-10 13:29:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 13:29:57,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:29:57,279 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:57,279 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:29:57,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-11-10 13:29:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:29:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:57,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:57,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:29:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:29:57,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:29:57,453 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:29:57,453 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-10 13:29:57,453 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-10 13:29:57,455 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:29:57,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:29:57,750 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:31:33,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:31:33,949 INFO L272 AbstractInterpreter]: Visited 44 different actions 2808 times. Merged at 37 different actions 2408 times. Widened at 5 different actions 163 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-11-10 13:31:33,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:33,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:31:33,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:33,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:31:33,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:33,973 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:31:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:34,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:31:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:31:34,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:31:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 13:31:34,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:31:34,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 12 [2018-11-10 13:31:34,143 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:31:34,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:31:34,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:31:34,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:31:34,144 INFO L87 Difference]: Start difference. First operand 185 states and 259 transitions. Second operand 8 states. [2018-11-10 13:31:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:34,230 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2018-11-10 13:31:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:31:34,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-10 13:31:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:34,232 INFO L225 Difference]: With dead ends: 209 [2018-11-10 13:31:34,232 INFO L226 Difference]: Without dead ends: 206 [2018-11-10 13:31:34,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:31:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-10 13:31:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-11-10 13:31:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-10 13:31:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 288 transitions. [2018-11-10 13:31:34,238 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 288 transitions. Word has length 70 [2018-11-10 13:31:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:34,239 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 288 transitions. [2018-11-10 13:31:34,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:31:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 288 transitions. [2018-11-10 13:31:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 13:31:34,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:34,239 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:34,240 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:34,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:34,240 INFO L82 PathProgramCache]: Analyzing trace with hash 564297596, now seen corresponding path program 1 times [2018-11-10 13:31:34,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:34,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:34,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:31:34,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:34,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:31:34,332 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-10 13:31:34,332 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-10 13:31:34,334 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:31:34,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:31:34,548 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:33:21,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:33:21,108 INFO L272 AbstractInterpreter]: Visited 46 different actions 2950 times. Merged at 39 different actions 2550 times. Widened at 5 different actions 163 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-11-10 13:33:21,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:21,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:33:21,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:33:21,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:33:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:21,118 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:33:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:21,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:33:21,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:33:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 13:33:21,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:33:21,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2018-11-10 13:33:21,362 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:33:21,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:33:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:33:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:33:21,363 INFO L87 Difference]: Start difference. First operand 206 states and 288 transitions. Second operand 7 states. [2018-11-10 13:33:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:21,502 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2018-11-10 13:33:21,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:33:21,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-10 13:33:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:21,503 INFO L225 Difference]: With dead ends: 230 [2018-11-10 13:33:21,503 INFO L226 Difference]: Without dead ends: 227 [2018-11-10 13:33:21,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:33:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-10 13:33:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-11-10 13:33:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-10 13:33:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 313 transitions. [2018-11-10 13:33:21,511 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 313 transitions. Word has length 79 [2018-11-10 13:33:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:21,511 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 313 transitions. [2018-11-10 13:33:21,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:33:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 313 transitions. [2018-11-10 13:33:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 13:33:21,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:21,512 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:21,512 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:21,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1030800333, now seen corresponding path program 1 times [2018-11-10 13:33:21,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:33:21,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:33:21,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:21,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:33:21,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:33:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:21,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:33:21,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:33:21,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-11-10 13:33:21,663 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-10 13:33:21,665 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:33:21,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:33:21,880 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:35:16,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:35:16,604 INFO L272 AbstractInterpreter]: Visited 44 different actions 2806 times. Merged at 37 different actions 2408 times. Widened at 5 different actions 163 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-11-10 13:35:16,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:16,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:35:16,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:16,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:35:16,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:16,611 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:35:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:16,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:16,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:35:17,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:35:17,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2018-11-10 13:35:17,050 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:35:17,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 13:35:17,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 13:35:17,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:35:17,051 INFO L87 Difference]: Start difference. First operand 224 states and 313 transitions. Second operand 10 states. [2018-11-10 13:35:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:17,186 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2018-11-10 13:35:17,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:35:17,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-11-10 13:35:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:17,188 INFO L225 Difference]: With dead ends: 227 [2018-11-10 13:35:17,188 INFO L226 Difference]: Without dead ends: 225 [2018-11-10 13:35:17,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:35:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-10 13:35:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-11-10 13:35:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-10 13:35:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 314 transitions. [2018-11-10 13:35:17,198 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 314 transitions. Word has length 82 [2018-11-10 13:35:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:17,198 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 314 transitions. [2018-11-10 13:35:17,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 13:35:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 314 transitions. [2018-11-10 13:35:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:35:17,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:17,199 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:17,199 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:17,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash 644642791, now seen corresponding path program 1 times [2018-11-10 13:35:17,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:17,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:17,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:17,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:17,200 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:35:17,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:17,324 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:17,324 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-11-10 13:35:17,324 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-10 13:35:17,325 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:35:17,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:35:17,636 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:36:53,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:36:53,257 INFO L272 AbstractInterpreter]: Visited 46 different actions 2937 times. Merged at 39 different actions 2536 times. Widened at 5 different actions 159 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-11-10 13:36:53,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:53,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:36:53,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:53,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:36:53,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:53,271 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:36:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:53,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:36:53,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 13:36:53,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:53,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 19 [2018-11-10 13:36:53,504 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:53,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 13:36:53,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 13:36:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:36:53,505 INFO L87 Difference]: Start difference. First operand 225 states and 314 transitions. Second operand 15 states. [2018-11-10 13:36:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:53,596 INFO L93 Difference]: Finished difference Result 268 states and 374 transitions. [2018-11-10 13:36:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:36:53,596 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-10 13:36:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:53,597 INFO L225 Difference]: With dead ends: 268 [2018-11-10 13:36:53,597 INFO L226 Difference]: Without dead ends: 264 [2018-11-10 13:36:53,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:36:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-10 13:36:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-11-10 13:36:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-10 13:36:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 365 transitions. [2018-11-10 13:36:53,604 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 365 transitions. Word has length 93 [2018-11-10 13:36:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:53,604 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 365 transitions. [2018-11-10 13:36:53,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 13:36:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 365 transitions. [2018-11-10 13:36:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 13:36:53,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:53,605 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:53,605 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:53,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:53,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1306502892, now seen corresponding path program 2 times [2018-11-10 13:36:53,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:36:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:53,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:36:53,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:36:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:36:53,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:53,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:36:53,851 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:36:53,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:36:53,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:36:53,852 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/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 13:36:53,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:36:53,858 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:36:53,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-10 13:36:53,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:36:53,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 13:36:54,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:36:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 13:36:54,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:36:54,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2018-11-10 13:36:54,626 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:36:54,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 13:36:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 13:36:54,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:36:54,627 INFO L87 Difference]: Start difference. First operand 261 states and 365 transitions. Second operand 18 states. [2018-11-10 13:36:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:55,102 INFO L93 Difference]: Finished difference Result 275 states and 380 transitions. [2018-11-10 13:36:55,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 13:36:55,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2018-11-10 13:36:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:55,103 INFO L225 Difference]: With dead ends: 275 [2018-11-10 13:36:55,103 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:36:55,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 13:36:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:36:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:36:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:36:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:36:55,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-11-10 13:36:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:55,105 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:36:55,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 13:36:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:36:55,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:36:55,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:36:55,846 WARN L179 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 45 [2018-11-10 13:36:55,988 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 37 [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:36:55,990 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-11-10 13:36:55,990 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-11-10 13:36:55,991 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-11-10 13:36:55,992 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-10 13:36:55,993 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= 0 (+ main_~P8~0 2147483648))) (.cse2 (<= main_~P8~0 2147483647)) (.cse3 (<= main_~this_buffer_empty~0 0)) (.cse4 (<= 0 main_~this_buffer_empty~0))) (or (and (exists ((main_~P1~0 Int)) (let ((.cse0 (mod main_~P1~0 2))) (and (= .cse0 0) (= .cse0 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) .cse1 .cse2 .cse3 .cse4) (and (exists ((main_~P1~0 Int)) (let ((.cse5 (mod main_~P1~0 2))) (and (= .cse5 0) (= .cse5 (mod (+ main_~this_expect~0 1) 2))))) .cse1 .cse2 .cse3 (= main_~q~0 3) .cse4) (and (<= main_~this_expect~0 main_~q~0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse3 .cse4))) [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= main_~this_buffer_empty~0 1)) (.cse3 (<= 1 main_~this_buffer_empty~0)) (.cse7 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod main_~this_expect~0 2)))))) (.cse0 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod (+ main_~this_expect~0 1) 2)))))) (.cse2 (<= 0 (+ main_~P8~0 2147483648))) (.cse4 (<= main_~P8~0 2147483647)) (.cse5 (<= main_~this_buffer_empty~0 0)) (.cse6 (<= 0 main_~this_buffer_empty~0))) (or (and .cse0 .cse1 .cse2 (= main_~q~0 4) .cse3 .cse4) (and (and (<= main_~this_expect~0 main_~q~0) (= main_~q~0 0)) (<= 0 main_~this_expect~0) .cse5 .cse6) (and .cse7 (= main_~q~0 1) .cse1 .cse2 .cse3 .cse4) (and .cse7 (<= 5 main_~q~0) .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse4 .cse5 (= main_~q~0 3) .cse6))) [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-11-10 13:36:55,994 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-11-10 13:36:55,995 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-11-10 13:36:55,996 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-10 13:36:56,000 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:36:56 BoogieIcfgContainer [2018-11-10 13:36:56,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:36:56,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:36:56,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:36:56,013 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:36:56,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:35" (3/4) ... [2018-11-10 13:36:56,017 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:36:56,021 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:36:56,022 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:36:56,028 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 13:36:56,028 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 13:36:56,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && q == 3) && 0 <= this_buffer_empty)) || ((((this_expect <= q && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-11-10 13:36:56,057 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0225129b-f9de-4dec-829d-6e69fd798eed/bin-2019/utaipan/witness.graphml [2018-11-10 13:36:56,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:36:56,058 INFO L168 Benchmark]: Toolchain (without parser) took 562009.00 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 959.2 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-11-10 13:36:56,058 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:36:56,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.43 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 937.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:36:56,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.94 ms. Allocated memory is still 1.0 GB. Free memory was 937.8 MB in the beginning and 935.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:36:56,059 INFO L168 Benchmark]: Boogie Preprocessor took 78.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:36:56,059 INFO L168 Benchmark]: RCFGBuilder took 619.06 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: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:36:56,060 INFO L168 Benchmark]: TraceAbstraction took 560967.47 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-11-10 13:36:56,060 INFO L168 Benchmark]: Witness Printer took 44.16 ms. Allocated memory is still 5.1 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:36:56,062 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.43 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 937.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.94 ms. Allocated memory is still 1.0 GB. Free memory was 937.8 MB in the beginning and 935.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 619.06 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: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 560967.47 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 44.16 ms. Allocated memory is still 5.1 GB. Free memory is still 2.8 GB. There was no memory consumed. 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[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 24]: Loop Invariant [2018-11-10 13:36:56,066 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,066 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,066 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,066 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,067 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,067 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,067 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,067 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,067 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,068 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,068 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,068 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,068 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,068 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,068 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,068 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647) || ((((this_expect <= q && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && q == 1) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && q == 3) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-11-10 13:36:56,069 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,069 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,069 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,069 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,069 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,070 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,070 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 13:36:56,070 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && q == 3) && 0 <= this_buffer_empty)) || ((((this_expect <= q && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 560.9s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 3319 SDtfs, 2282 SDslu, 9787 SDs, 0 SdLazy, 1572 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1529 GetRequests, 1358 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 548.8s AbstIntTime, 11 AbstIntIterations, 1 AbstIntStrong, 0.943293885601578 AbsIntWeakeningRatio, 1.7307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 662.5769230769231 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 61 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 40 NumberOfFragments, 238 HoareAnnotationTreeSize, 7 FomulaSimplifications, 819 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2772 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1615 NumberOfCodeBlocks, 1573 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2258 ConstructedInterpolants, 297 QuantifiedInterpolants, 1685642 SizeOfPredicates, 55 NumberOfNonLiveVariables, 4413 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 952/2434 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...