./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-635dfa2 [2018-12-09 16:06:03,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:06:03,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:06:03,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:06:03,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:06:03,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:06:03,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:06:03,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:06:03,930 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:06:03,931 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:06:03,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:06:03,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:06:03,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:06:03,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:06:03,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:06:03,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:06:03,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:06:03,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:06:03,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:06:03,936 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:06:03,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:06:03,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:06:03,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:06:03,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:06:03,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:06:03,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:06:03,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:06:03,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:06:03,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:06:03,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:06:03,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:06:03,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:06:03,941 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:06:03,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:06:03,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:06:03,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:06:03,942 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 16:06:03,949 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:06:03,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:06:03,950 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:06:03,950 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:06:03,950 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:06:03,950 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:06:03,950 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:06:03,950 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:06:03,951 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:06:03,951 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:06:03,951 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:06:03,951 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:06:03,951 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:06:03,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:06:03,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:06:03,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 16:06:03,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:06:03,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:06:03,953 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:06:03,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:06:03,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:06:03,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:06:03,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 16:06:03,953 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:06:03,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:06:03,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:06:03,953 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 16:06:03,953 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_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:03,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:06:03,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:06:03,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:06:03,980 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:06:03,981 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:06:03,981 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-09 16:06:04,015 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/data/8f3198327/56f4dbe7e18e40028bc39b148ed65034/FLAG0ede64687 [2018-12-09 16:06:04,309 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:06:04,310 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-09 16:06:04,316 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/data/8f3198327/56f4dbe7e18e40028bc39b148ed65034/FLAG0ede64687 [2018-12-09 16:06:04,324 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/data/8f3198327/56f4dbe7e18e40028bc39b148ed65034 [2018-12-09 16:06:04,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:06:04,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:06:04,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:06:04,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:06:04,330 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:06:04,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484c0a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04, skipping insertion in model container [2018-12-09 16:06:04,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:06:04,355 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:06:04,488 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:06:04,491 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:06:04,524 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:06:04,566 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:06:04,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04 WrapperNode [2018-12-09 16:06:04,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:06:04,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:06:04,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:06:04,567 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:06:04,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:06:04,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:06:04,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:06:04,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:06:04,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... [2018-12-09 16:06:04,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:06:04,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:06:04,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:06:04,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:06:04,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:06:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:06:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:06:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:06:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:06:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:06:05,039 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:06:05,040 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 16:06:05,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:06:05 BoogieIcfgContainer [2018-12-09 16:06:05,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:06:05,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:06:05,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:06:05,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:06:05,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:06:04" (1/3) ... [2018-12-09 16:06:05,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a66e547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:06:05, skipping insertion in model container [2018-12-09 16:06:05,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:04" (2/3) ... [2018-12-09 16:06:05,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a66e547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:06:05, skipping insertion in model container [2018-12-09 16:06:05,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:06:05" (3/3) ... [2018-12-09 16:06:05,044 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-09 16:06:05,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:06:05,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 16:06:05,064 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 16:06:05,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:06:05,083 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 16:06:05,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:06:05,083 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:06:05,083 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:06:05,083 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:06:05,083 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:06:05,083 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:06:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-12-09 16:06:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 16:06:05,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:05,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:05,100 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:05,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1483071650, now seen corresponding path program 1 times [2018-12-09 16:06:05,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:05,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:05,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:05,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:05,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:06:05,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:05,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 16:06:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 16:06:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 16:06:05,195 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-12-09 16:06:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:05,213 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-12-09 16:06:05,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 16:06:05,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-12-09 16:06:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:05,221 INFO L225 Difference]: With dead ends: 222 [2018-12-09 16:06:05,221 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 16:06:05,223 INFO L631 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-12-09 16:06:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 16:06:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-09 16:06:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 16:06:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-12-09 16:06:05,247 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-12-09 16:06:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:05,247 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-12-09 16:06:05,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 16:06:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-12-09 16:06:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 16:06:05,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:05,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:05,248 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:05,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:05,248 INFO L82 PathProgramCache]: Analyzing trace with hash -736931587, now seen corresponding path program 1 times [2018-12-09 16:06:05,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:05,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:05,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:05,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:05,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:06:05,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:05,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:05,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:06:05,276 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-12-09 16:06:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:05,309 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-12-09 16:06:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:05,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 16:06:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:05,310 INFO L225 Difference]: With dead ends: 205 [2018-12-09 16:06:05,310 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 16:06:05,311 INFO L631 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-12-09 16:06:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 16:06:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 16:06:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 16:06:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-12-09 16:06:05,319 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-12-09 16:06:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:05,320 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-12-09 16:06:05,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-12-09 16:06:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:06:05,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:05,321 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:05,321 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:05,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:05,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1504395429, now seen corresponding path program 1 times [2018-12-09 16:06:05,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:05,726 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 39 [2018-12-09 16:06:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:05,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:05,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:06:05,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:05,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:06:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:06:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:06:05,731 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2018-12-09 16:06:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:05,909 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-12-09 16:06:05,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:05,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-09 16:06:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:05,910 INFO L225 Difference]: With dead ends: 209 [2018-12-09 16:06:05,910 INFO L226 Difference]: Without dead ends: 190 [2018-12-09 16:06:05,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:06:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-09 16:06:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-12-09 16:06:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-09 16:06:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-12-09 16:06:05,917 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-12-09 16:06:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:05,917 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-12-09 16:06:05,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:06:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-12-09 16:06:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 16:06:05,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:05,918 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:05,918 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:05,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2142865338, now seen corresponding path program 1 times [2018-12-09 16:06:05,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:05,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:05,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:06:05,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:05,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:05,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:05,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:06:05,935 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-12-09 16:06:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:05,955 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-12-09 16:06:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:05,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 16:06:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:05,956 INFO L225 Difference]: With dead ends: 297 [2018-12-09 16:06:05,956 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 16:06:05,957 INFO L631 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-12-09 16:06:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 16:06:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-12-09 16:06:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-09 16:06:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-12-09 16:06:05,962 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-12-09 16:06:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:05,962 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-12-09 16:06:05,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-12-09 16:06:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 16:06:05,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:05,963 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:05,963 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:05,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2011475352, now seen corresponding path program 1 times [2018-12-09 16:06:05,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:05,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:05,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:06:05,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:05,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:06:05,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:05,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:06:05,986 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-12-09 16:06:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:06,005 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-12-09 16:06:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:06,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 16:06:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:06,006 INFO L225 Difference]: With dead ends: 230 [2018-12-09 16:06:06,006 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 16:06:06,006 INFO L631 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-12-09 16:06:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 16:06:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-12-09 16:06:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 16:06:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-12-09 16:06:06,010 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-12-09 16:06:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:06,010 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-12-09 16:06:06,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-12-09 16:06:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 16:06:06,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:06,011 INFO L402 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-12-09 16:06:06,011 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:06,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1818456969, now seen corresponding path program 1 times [2018-12-09 16:06:06,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:06,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:06,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:06,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:06,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:06,053 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 16:06:06,054 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [232], [235], [238], [519], [522], [523], [524] [2018-12-09 16:06:06,077 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:06,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:06,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:06,316 INFO L272 AbstractInterpreter]: Visited 24 different actions 49 times. Merged at 17 different actions 21 times. Never widened. Performed 683 root evaluator evaluations with a maximum evaluation depth of 10. Performed 683 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-12-09 16:06:06,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:06,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:06,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:06,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:06,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:06,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:06,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:06,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:06,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:06,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-09 16:06:06,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:06,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:06:06,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:06:06,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:06:06,430 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-12-09 16:06:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:06,529 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-12-09 16:06:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:06:06,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-09 16:06:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:06,530 INFO L225 Difference]: With dead ends: 192 [2018-12-09 16:06:06,530 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 16:06:06,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:06:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 16:06:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-12-09 16:06:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 16:06:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-12-09 16:06:06,536 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-12-09 16:06:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:06,536 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-12-09 16:06:06,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:06:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-12-09 16:06:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:06:06,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:06,537 INFO L402 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] [2018-12-09 16:06:06,537 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:06,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 549034740, now seen corresponding path program 1 times [2018-12-09 16:06:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:06,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:06,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:06,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:06,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:06,748 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-09 16:06:06,748 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [253], [519], [522], [523], [524] [2018-12-09 16:06:06,749 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:06,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:06,831 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:06,832 INFO L272 AbstractInterpreter]: Visited 25 different actions 51 times. Merged at 18 different actions 22 times. Never widened. Performed 721 root evaluator evaluations with a maximum evaluation depth of 10. Performed 721 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 40 variables. [2018-12-09 16:06:06,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:06,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:06,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:06,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:06,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:06,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:06,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:06,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:06:07,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:06:07,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2018-12-09 16:06:07,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:07,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:06:07,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:06:07,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:06:07,012 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 4 states. [2018-12-09 16:06:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:07,132 INFO L93 Difference]: Finished difference Result 289 states and 444 transitions. [2018-12-09 16:06:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:07,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-09 16:06:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:07,133 INFO L225 Difference]: With dead ends: 289 [2018-12-09 16:06:07,134 INFO L226 Difference]: Without dead ends: 280 [2018-12-09 16:06:07,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:06:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-09 16:06:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2018-12-09 16:06:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-09 16:06:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 408 transitions. [2018-12-09 16:06:07,143 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 408 transitions. Word has length 28 [2018-12-09 16:06:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:07,144 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 408 transitions. [2018-12-09 16:06:07,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:06:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 408 transitions. [2018-12-09 16:06:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 16:06:07,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:07,145 INFO L402 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] [2018-12-09 16:06:07,145 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:07,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1113591962, now seen corresponding path program 1 times [2018-12-09 16:06:07,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:07,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:07,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:07,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:06:07,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:07,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:06:07,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:07,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:07,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:07,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:06:07,168 INFO L87 Difference]: Start difference. First operand 262 states and 408 transitions. Second operand 3 states. [2018-12-09 16:06:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:07,189 INFO L93 Difference]: Finished difference Result 454 states and 703 transitions. [2018-12-09 16:06:07,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:07,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 16:06:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:07,190 INFO L225 Difference]: With dead ends: 454 [2018-12-09 16:06:07,190 INFO L226 Difference]: Without dead ends: 220 [2018-12-09 16:06:07,191 INFO L631 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-12-09 16:06:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-09 16:06:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2018-12-09 16:06:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-09 16:06:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 326 transitions. [2018-12-09 16:06:07,198 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 326 transitions. Word has length 29 [2018-12-09 16:06:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:07,199 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 326 transitions. [2018-12-09 16:06:07,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 326 transitions. [2018-12-09 16:06:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:06:07,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:07,200 INFO L402 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-12-09 16:06:07,200 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:07,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:07,200 INFO L82 PathProgramCache]: Analyzing trace with hash 454582667, now seen corresponding path program 1 times [2018-12-09 16:06:07,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:07,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:07,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:07,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:07,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:07,421 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2018-12-09 16:06:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:07,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:07,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:07,425 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-09 16:06:07,425 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [260], [275], [290], [293], [296], [299], [519], [522], [523], [524] [2018-12-09 16:06:07,427 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:07,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:07,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:07,497 INFO L272 AbstractInterpreter]: Visited 28 different actions 39 times. Merged at 7 different actions 8 times. Never widened. Performed 497 root evaluator evaluations with a maximum evaluation depth of 10. Performed 497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 3 fixpoints after 2 different actions. Largest state had 43 variables. [2018-12-09 16:06:07,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:07,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:07,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:07,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:07,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:07,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:07,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:06:07,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 16:06:07,616 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:06:07,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-12-09 16:06:07,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:07,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:07,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:06:07,617 INFO L87 Difference]: Start difference. First operand 218 states and 326 transitions. Second operand 3 states. [2018-12-09 16:06:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:07,626 INFO L93 Difference]: Finished difference Result 221 states and 328 transitions. [2018-12-09 16:06:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:07,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 16:06:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:07,628 INFO L225 Difference]: With dead ends: 221 [2018-12-09 16:06:07,628 INFO L226 Difference]: Without dead ends: 215 [2018-12-09 16:06:07,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:06:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-09 16:06:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-12-09 16:06:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-09 16:06:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 317 transitions. [2018-12-09 16:06:07,635 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 317 transitions. Word has length 31 [2018-12-09 16:06:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:07,635 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 317 transitions. [2018-12-09 16:06:07,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 317 transitions. [2018-12-09 16:06:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 16:06:07,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:07,637 INFO L402 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-12-09 16:06:07,637 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:07,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash 362155736, now seen corresponding path program 1 times [2018-12-09 16:06:07,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:07,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:07,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 16:06:07,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:07,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:06:07,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:07,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:06:07,664 INFO L87 Difference]: Start difference. First operand 214 states and 317 transitions. Second operand 3 states. [2018-12-09 16:06:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:07,684 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2018-12-09 16:06:07,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:07,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 16:06:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:07,686 INFO L225 Difference]: With dead ends: 363 [2018-12-09 16:06:07,686 INFO L226 Difference]: Without dead ends: 177 [2018-12-09 16:06:07,686 INFO L631 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-12-09 16:06:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-09 16:06:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-12-09 16:06:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-09 16:06:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 257 transitions. [2018-12-09 16:06:07,690 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 257 transitions. Word has length 36 [2018-12-09 16:06:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:07,691 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 257 transitions. [2018-12-09 16:06:07,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2018-12-09 16:06:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 16:06:07,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:07,691 INFO L402 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-12-09 16:06:07,691 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:07,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1093179144, now seen corresponding path program 1 times [2018-12-09 16:06:07,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:07,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:07,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:07,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:07,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 16:06:07,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:07,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:07,754 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-12-09 16:06:07,754 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [328], [331], [334], [519], [522], [523], [524] [2018-12-09 16:06:07,756 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:07,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:07,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:07,887 INFO L272 AbstractInterpreter]: Visited 30 different actions 79 times. Merged at 23 different actions 41 times. Never widened. Performed 1029 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1029 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 9 fixpoints after 6 different actions. Largest state had 41 variables. [2018-12-09 16:06:07,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:07,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:07,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:07,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:07,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:07,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:07,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 16:06:07,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 16:06:08,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:08,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-09 16:06:08,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:08,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:06:08,044 INFO L87 Difference]: Start difference. First operand 175 states and 257 transitions. Second operand 5 states. [2018-12-09 16:06:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:08,100 INFO L93 Difference]: Finished difference Result 252 states and 370 transitions. [2018-12-09 16:06:08,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:08,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-09 16:06:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:08,101 INFO L225 Difference]: With dead ends: 252 [2018-12-09 16:06:08,101 INFO L226 Difference]: Without dead ends: 247 [2018-12-09 16:06:08,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:06:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-09 16:06:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 241. [2018-12-09 16:06:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-09 16:06:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 356 transitions. [2018-12-09 16:06:08,110 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 356 transitions. Word has length 37 [2018-12-09 16:06:08,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:08,111 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 356 transitions. [2018-12-09 16:06:08,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 356 transitions. [2018-12-09 16:06:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:06:08,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:08,112 INFO L402 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-12-09 16:06:08,112 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:08,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash 939353414, now seen corresponding path program 1 times [2018-12-09 16:06:08,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:08,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:08,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:08,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:08,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:08,289 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-09 16:06:08,289 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [379], [519], [522], [523], [524] [2018-12-09 16:06:08,290 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:08,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:08,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:08,338 INFO L272 AbstractInterpreter]: Visited 33 different actions 44 times. Merged at 7 different actions 8 times. Never widened. Performed 539 root evaluator evaluations with a maximum evaluation depth of 10. Performed 539 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 44 variables. [2018-12-09 16:06:08,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:08,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:08,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:08,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:08,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:08,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:08,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:08,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:08,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:08,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-09 16:06:08,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:08,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:06:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:06:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:06:08,680 INFO L87 Difference]: Start difference. First operand 241 states and 356 transitions. Second operand 8 states. [2018-12-09 16:06:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:08,770 INFO L93 Difference]: Finished difference Result 251 states and 365 transitions. [2018-12-09 16:06:08,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:06:08,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-09 16:06:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:08,771 INFO L225 Difference]: With dead ends: 251 [2018-12-09 16:06:08,771 INFO L226 Difference]: Without dead ends: 249 [2018-12-09 16:06:08,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:06:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-12-09 16:06:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 242. [2018-12-09 16:06:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-09 16:06:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2018-12-09 16:06:08,776 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 40 [2018-12-09 16:06:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:08,776 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2018-12-09 16:06:08,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:06:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2018-12-09 16:06:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 16:06:08,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:08,777 INFO L402 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-12-09 16:06:08,777 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:08,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:08,777 INFO L82 PathProgramCache]: Analyzing trace with hash -819577482, now seen corresponding path program 1 times [2018-12-09 16:06:08,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:08,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:08,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 16:06:08,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:08,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:06:08,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:08,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:08,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:06:08,793 INFO L87 Difference]: Start difference. First operand 242 states and 357 transitions. Second operand 3 states. [2018-12-09 16:06:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:08,812 INFO L93 Difference]: Finished difference Result 422 states and 620 transitions. [2018-12-09 16:06:08,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:08,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-09 16:06:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:08,813 INFO L225 Difference]: With dead ends: 422 [2018-12-09 16:06:08,813 INFO L226 Difference]: Without dead ends: 226 [2018-12-09 16:06:08,814 INFO L631 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-12-09 16:06:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-09 16:06:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-12-09 16:06:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-09 16:06:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 320 transitions. [2018-12-09 16:06:08,821 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 320 transitions. Word has length 41 [2018-12-09 16:06:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:08,822 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 320 transitions. [2018-12-09 16:06:08,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 320 transitions. [2018-12-09 16:06:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 16:06:08,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:08,823 INFO L402 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-12-09 16:06:08,823 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:08,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 711556807, now seen corresponding path program 1 times [2018-12-09 16:06:08,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:08,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:08,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 16:06:08,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:08,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:06:08,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:08,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:08,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:08,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:06:08,850 INFO L87 Difference]: Start difference. First operand 224 states and 320 transitions. Second operand 3 states. [2018-12-09 16:06:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:08,870 INFO L93 Difference]: Finished difference Result 305 states and 435 transitions. [2018-12-09 16:06:08,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:08,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 16:06:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:08,872 INFO L225 Difference]: With dead ends: 305 [2018-12-09 16:06:08,872 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 16:06:08,872 INFO L631 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-12-09 16:06:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 16:06:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-12-09 16:06:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-09 16:06:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 200 transitions. [2018-12-09 16:06:08,877 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 200 transitions. Word has length 50 [2018-12-09 16:06:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:08,877 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 200 transitions. [2018-12-09 16:06:08,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2018-12-09 16:06:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 16:06:08,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:08,878 INFO L402 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-12-09 16:06:08,878 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:08,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:08,879 INFO L82 PathProgramCache]: Analyzing trace with hash -370372205, now seen corresponding path program 1 times [2018-12-09 16:06:08,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:08,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:08,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:08,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:08,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 16:06:08,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:08,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:08,941 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-09 16:06:08,941 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [439], [442], [445], [519], [522], [523], [524] [2018-12-09 16:06:08,942 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:08,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:08,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:08,989 INFO L272 AbstractInterpreter]: Visited 39 different actions 50 times. Merged at 7 different actions 8 times. Never widened. Performed 571 root evaluator evaluations with a maximum evaluation depth of 10. Performed 571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 5 fixpoints after 4 different actions. Largest state had 46 variables. [2018-12-09 16:06:08,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:08,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:08,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:08,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:08,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:08,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:09,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:09,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:09,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:09,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-12-09 16:06:09,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:09,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:06:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:06:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:06:09,155 INFO L87 Difference]: Start difference. First operand 144 states and 200 transitions. Second operand 9 states. [2018-12-09 16:06:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:09,201 INFO L93 Difference]: Finished difference Result 187 states and 260 transitions. [2018-12-09 16:06:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:06:09,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-12-09 16:06:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:09,202 INFO L225 Difference]: With dead ends: 187 [2018-12-09 16:06:09,202 INFO L226 Difference]: Without dead ends: 183 [2018-12-09 16:06:09,202 INFO L631 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-12-09 16:06:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-09 16:06:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2018-12-09 16:06:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-09 16:06:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2018-12-09 16:06:09,205 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 51 [2018-12-09 16:06:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:09,206 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2018-12-09 16:06:09,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:06:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2018-12-09 16:06:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 16:06:09,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:09,206 INFO L402 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-12-09 16:06:09,206 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:09,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash -379328264, now seen corresponding path program 1 times [2018-12-09 16:06:09,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:09,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:09,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:09,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:09,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:11,522 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 194 DAG size of output: 36 [2018-12-09 16:06:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:11,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:11,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:11,532 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-12-09 16:06:11,532 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [47], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [522], [523], [524] [2018-12-09 16:06:11,534 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:11,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:11,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:11,761 INFO L272 AbstractInterpreter]: Visited 44 different actions 142 times. Merged at 35 different actions 84 times. Widened at 1 different actions 1 times. Performed 1741 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1741 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 17 fixpoints after 9 different actions. Largest state had 50 variables. [2018-12-09 16:06:11,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:11,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:11,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:11,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:11,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:11,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:11,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:11,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:06:12,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:12,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2018-12-09 16:06:12,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:12,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 16:06:12,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 16:06:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-09 16:06:12,275 INFO L87 Difference]: Start difference. First operand 180 states and 251 transitions. Second operand 11 states. [2018-12-09 16:06:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:12,517 INFO L93 Difference]: Finished difference Result 186 states and 257 transitions. [2018-12-09 16:06:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 16:06:12,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-12-09 16:06:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:12,518 INFO L225 Difference]: With dead ends: 186 [2018-12-09 16:06:12,518 INFO L226 Difference]: Without dead ends: 184 [2018-12-09 16:06:12,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:06:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-09 16:06:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-12-09 16:06:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-09 16:06:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 252 transitions. [2018-12-09 16:06:12,525 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 252 transitions. Word has length 61 [2018-12-09 16:06:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:12,525 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 252 transitions. [2018-12-09 16:06:12,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 16:06:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 252 transitions. [2018-12-09 16:06:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 16:06:12,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:12,526 INFO L402 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-12-09 16:06:12,527 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:12,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash -784011109, now seen corresponding path program 1 times [2018-12-09 16:06:12,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:12,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:12,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 16:06:12,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:12,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:12,649 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-12-09 16:06:12,650 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [328], [331], [334], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [522], [523], [524] [2018-12-09 16:06:12,652 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:12,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:12,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:12,798 INFO L272 AbstractInterpreter]: Visited 46 different actions 111 times. Merged at 37 different actions 55 times. Never widened. Performed 1404 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1404 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-12-09 16:06:12,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:12,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:12,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:12,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:12,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:12,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:12,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 16:06:12,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-09 16:06:12,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:12,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2018-12-09 16:06:12,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:12,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:06:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:06:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:06:12,969 INFO L87 Difference]: Start difference. First operand 181 states and 252 transitions. Second operand 7 states. [2018-12-09 16:06:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:13,034 INFO L93 Difference]: Finished difference Result 223 states and 308 transitions. [2018-12-09 16:06:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:06:13,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-12-09 16:06:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:13,035 INFO L225 Difference]: With dead ends: 223 [2018-12-09 16:06:13,035 INFO L226 Difference]: Without dead ends: 220 [2018-12-09 16:06:13,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:06:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-09 16:06:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-12-09 16:06:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-09 16:06:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 302 transitions. [2018-12-09 16:06:13,040 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 302 transitions. Word has length 79 [2018-12-09 16:06:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:13,040 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 302 transitions. [2018-12-09 16:06:13,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:06:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 302 transitions. [2018-12-09 16:06:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 16:06:13,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:13,041 INFO L402 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-12-09 16:06:13,041 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:13,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1961279789, now seen corresponding path program 1 times [2018-12-09 16:06:13,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:13,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:13,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:13,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:15,366 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-12-09 16:06:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:15,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:15,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:15,378 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-12-09 16:06:15,378 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [379], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [522], [523], [524] [2018-12-09 16:06:15,379 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:15,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:15,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:15,521 INFO L272 AbstractInterpreter]: Visited 44 different actions 104 times. Merged at 35 different actions 50 times. Never widened. Performed 1455 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1455 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-12-09 16:06:15,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:15,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:15,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:15,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:15,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:15,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:15,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:15,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 16:06:16,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:16,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2018-12-09 16:06:16,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:16,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 16:06:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 16:06:16,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:06:16,083 INFO L87 Difference]: Start difference. First operand 217 states and 302 transitions. Second operand 11 states. [2018-12-09 16:06:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:16,216 INFO L93 Difference]: Finished difference Result 220 states and 305 transitions. [2018-12-09 16:06:16,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:06:16,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-12-09 16:06:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:16,217 INFO L225 Difference]: With dead ends: 220 [2018-12-09 16:06:16,217 INFO L226 Difference]: Without dead ends: 218 [2018-12-09 16:06:16,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:06:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-09 16:06:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-12-09 16:06:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-09 16:06:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 303 transitions. [2018-12-09 16:06:16,222 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 303 transitions. Word has length 82 [2018-12-09 16:06:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:16,222 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 303 transitions. [2018-12-09 16:06:16,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 16:06:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 303 transitions. [2018-12-09 16:06:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 16:06:16,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:16,223 INFO L402 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-12-09 16:06:16,223 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:16,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash -101241370, now seen corresponding path program 1 times [2018-12-09 16:06:16,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:16,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:16,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:16,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:16,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 16:06:16,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:16,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:16,306 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-12-09 16:06:16,306 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [439], [442], [445], [451], [466], [481], [496], [499], [502], [507], [519], [522], [523], [524] [2018-12-09 16:06:16,307 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:16,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:16,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:06:16,414 INFO L272 AbstractInterpreter]: Visited 46 different actions 111 times. Merged at 37 different actions 55 times. Never widened. Performed 1404 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1404 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-12-09 16:06:16,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:16,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:06:16,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:16,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:16,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:16,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:06:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:16,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:16,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 16:06:16,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 19 [2018-12-09 16:06:16,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:16,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 16:06:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 16:06:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:06:16,634 INFO L87 Difference]: Start difference. First operand 218 states and 303 transitions. Second operand 15 states. [2018-12-09 16:06:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:16,733 INFO L93 Difference]: Finished difference Result 261 states and 363 transitions. [2018-12-09 16:06:16,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:06:16,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-12-09 16:06:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:16,734 INFO L225 Difference]: With dead ends: 261 [2018-12-09 16:06:16,734 INFO L226 Difference]: Without dead ends: 257 [2018-12-09 16:06:16,734 INFO L631 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-12-09 16:06:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-09 16:06:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-12-09 16:06:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-09 16:06:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 354 transitions. [2018-12-09 16:06:16,739 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 354 transitions. Word has length 93 [2018-12-09 16:06:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:16,739 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 354 transitions. [2018-12-09 16:06:16,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 16:06:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2018-12-09 16:06:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 16:06:16,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:16,740 INFO L402 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-12-09 16:06:16,740 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:16,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:16,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1744733813, now seen corresponding path program 2 times [2018-12-09 16:06:16,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:16,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:16,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:16,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:17,135 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-12-09 16:06:17,346 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-12-09 16:06:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:17,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:17,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:17,361 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:06:17,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:06:17,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:17,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/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-12-09 16:06:17,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:06:17,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:06:17,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 16:06:17,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:06:17,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:06:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 16:06:17,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:06:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 16:06:18,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:06:18,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 23 [2018-12-09 16:06:18,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:06:18,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:06:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:06:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-12-09 16:06:18,062 INFO L87 Difference]: Start difference. First operand 254 states and 354 transitions. Second operand 19 states. [2018-12-09 16:06:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:18,558 INFO L93 Difference]: Finished difference Result 268 states and 369 transitions. [2018-12-09 16:06:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 16:06:18,558 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 103 [2018-12-09 16:06:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:18,559 INFO L225 Difference]: With dead ends: 268 [2018-12-09 16:06:18,559 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 16:06:18,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1449, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 16:06:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 16:06:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 16:06:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 16:06:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 16:06:18,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-12-09 16:06:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:18,560 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 16:06:18,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:06:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 16:06:18,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 16:06:18,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 16:06:18,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 16:06:18,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 16:06:18,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 16:06:18,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 16:06:18,776 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2018-12-09 16:06:18,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 16:06:18,778 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 16:06:18,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 16:06:18,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 16:06:18,778 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 16:06:18,779 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-12-09 16:06:18,779 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-12-09 16:06:18,780 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-12-09 16:06:18,781 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L444 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-12-09 16:06:18,782 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L444 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse3 (<= main_~this_buffer_empty~0 1)) (.cse5 (<= 1 main_~this_buffer_empty~0)) (.cse7 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse4 (<= 0 (+ main_~P8~0 2147483648))) (.cse6 (<= main_~P8~0 2147483647)) (.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod (+ main_~this_expect~0 1) 2))))) .cse3 .cse4 .cse5 (= main_~q~0 4) .cse6) (and (= 0 (mod (+ main_~this_expect~0 1) 2)) .cse4 (= main_~q~0 3) .cse6 .cse0 .cse1) (and .cse7 (= main_~q~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse7 (<= 5 main_~q~0) .cse4 .cse6 .cse0 .cse1))) [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-12-09 16:06:18,783 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-12-09 16:06:18,784 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-12-09 16:06:18,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:06:18 BoogieIcfgContainer [2018-12-09 16:06:18,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:06:18,799 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:06:18,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:06:18,799 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:06:18,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:06:05" (3/4) ... [2018-12-09 16:06:18,802 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 16:06:18,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 16:06:18,806 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 16:06:18,811 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 16:06:18,811 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 16:06:18,828 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && 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) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-12-09 16:06:18,834 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_50650fbb-42de-44dc-ba13-eb9321c9465d/bin-2019/utaipan/witness.graphml [2018-12-09 16:06:18,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:06:18,835 INFO L168 Benchmark]: Toolchain (without parser) took 14508.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 322.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:06:18,836 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:06:18,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-12-09 16:06:18,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:06:18,836 INFO L168 Benchmark]: Boogie Preprocessor took 34.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:06:18,836 INFO L168 Benchmark]: RCFGBuilder took 421.84 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:06:18,837 INFO L168 Benchmark]: TraceAbstraction took 13758.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.7 MB). Peak memory consumption was 295.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:06:18,837 INFO L168 Benchmark]: Witness Printer took 35.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:06:18,839 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 421.84 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: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13758.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 319.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.7 MB). Peak memory consumption was 295.1 MB. Max. memory is 11.5 GB. * Witness Printer took 35.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.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] * 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-12-09 16:06:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && 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) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 24]: Loop Invariant [2018-12-09 16:06:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 16:06:18,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((this_expect <= 0 && 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 + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && q == 4) && P8 <= 2147483647)) || (((((0 == (this_expect + 1) % 2 && 0 <= P8 + 2147483648) && q == 3) && 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 % 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) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 3253 SDtfs, 2076 SDslu, 9865 SDs, 0 SdLazy, 1581 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1400 GetRequests, 1233 SyntacticMatches, 21 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 10 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 72 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 38 NumberOfFragments, 194 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1968 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 572 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1511 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2101 ConstructedInterpolants, 324 QuantifiedInterpolants, 1809542 SizeOfPredicates, 55 NumberOfNonLiveVariables, 4088 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 42 InterpolantComputations, 12 PerfectInterpolantSequences, 901/2194 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...