./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.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_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 d7ee2ac819f7b75cfc0560bac3b8eea31e76c5dc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:41:21,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:41:21,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:41:21,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:41:21,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:41:21,758 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:41:21,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:41:21,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:41:21,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:41:21,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:41:21,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:41:21,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:41:21,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:41:21,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:41:21,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:41:21,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:41:21,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:41:21,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:41:21,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:41:21,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:41:21,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:41:21,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:41:21,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:41:21,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:41:21,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:41:21,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:41:21,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:41:21,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:41:21,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:41:21,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:41:21,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:41:21,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:41:21,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:41:21,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:41:21,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:41:21,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:41:21,780 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 01:41:21,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:41:21,790 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:41:21,791 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:41:21,791 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:41:21,791 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:41:21,791 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:41:21,791 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:41:21,792 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 01:41:21,792 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:41:21,792 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:41:21,792 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 01:41:21,792 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 01:41:21,792 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:41:21,793 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:41:21,793 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:41:21,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:41:21,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:41:21,793 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:41:21,793 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:41:21,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:41:21,794 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:41:21,794 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:41:21,794 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:41:21,794 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:41:21,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:41:21,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:41:21,794 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:41:21,794 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:41:21,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:41:21,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:41:21,795 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:41:21,795 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:41:21,795 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 01:41:21,795 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:41:21,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:41:21,795 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 01:41:21,795 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_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 -> d7ee2ac819f7b75cfc0560bac3b8eea31e76c5dc [2018-12-09 01:41:21,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:41:21,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:41:21,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:41:21,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:41:21,831 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:41:21,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-12-09 01:41:21,871 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/data/558235a95/acdc415f9b1747c2849534350c503ffe/FLAG53c1550a4 [2018-12-09 01:41:22,244 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:41:22,244 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/sv-benchmarks/c/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-12-09 01:41:22,251 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/data/558235a95/acdc415f9b1747c2849534350c503ffe/FLAG53c1550a4 [2018-12-09 01:41:22,614 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/data/558235a95/acdc415f9b1747c2849534350c503ffe [2018-12-09 01:41:22,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:41:22,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:41:22,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:41:22,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:41:22,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:41:22,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:22,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34882f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22, skipping insertion in model container [2018-12-09 01:41:22,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:22,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:41:22,664 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:41:22,853 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:41:22,855 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:41:22,980 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:41:22,990 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:41:22,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22 WrapperNode [2018-12-09 01:41:22,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:41:22,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:41:22,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:41:22,991 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:41:22,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:41:23,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:41:23,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:41:23,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:41:23,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... [2018-12-09 01:41:23,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:41:23,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:41:23,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:41:23,075 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:41:23,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:41:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:41:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:41:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-09 01:41:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-09 01:41:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:41:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:41:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:41:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:41:23,812 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:41:23,812 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 01:41:23,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:23 BoogieIcfgContainer [2018-12-09 01:41:23,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:41:23,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:41:23,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:41:23,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:41:23,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:41:22" (1/3) ... [2018-12-09 01:41:23,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e72e8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:41:23, skipping insertion in model container [2018-12-09 01:41:23,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:22" (2/3) ... [2018-12-09 01:41:23,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e72e8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:41:23, skipping insertion in model container [2018-12-09 01:41:23,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:23" (3/3) ... [2018-12-09 01:41:23,819 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label55_true-unreach-call_false-termination.c [2018-12-09 01:41:23,826 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:41:23,831 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 01:41:23,841 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 01:41:23,862 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:41:23,863 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:41:23,863 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:41:23,863 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:41:23,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:41:23,863 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:41:23,863 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:41:23,863 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:41:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2018-12-09 01:41:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 01:41:23,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:23,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:23,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:23,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash 606791250, now seen corresponding path program 1 times [2018-12-09 01:41:23,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:23,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:23,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:24,073 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 01:41:24,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:24,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:41:24,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:41:24,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:41:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:41:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:24,093 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2018-12-09 01:41:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:24,973 INFO L93 Difference]: Finished difference Result 890 states and 1607 transitions. [2018-12-09 01:41:24,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:41:24,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 01:41:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:24,983 INFO L225 Difference]: With dead ends: 890 [2018-12-09 01:41:24,983 INFO L226 Difference]: Without dead ends: 554 [2018-12-09 01:41:24,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-09 01:41:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2018-12-09 01:41:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-12-09 01:41:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 806 transitions. [2018-12-09 01:41:25,028 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 806 transitions. Word has length 63 [2018-12-09 01:41:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:25,028 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 806 transitions. [2018-12-09 01:41:25,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:41:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 806 transitions. [2018-12-09 01:41:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:41:25,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:25,032 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:41:25,033 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:25,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:25,033 INFO L82 PathProgramCache]: Analyzing trace with hash 905975074, now seen corresponding path program 1 times [2018-12-09 01:41:25,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:25,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:25,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:25,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:25,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:41:25,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:25,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:41:25,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:41:25,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:41:25,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:41:25,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:25,125 INFO L87 Difference]: Start difference. First operand 554 states and 806 transitions. Second operand 4 states. [2018-12-09 01:41:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:25,847 INFO L93 Difference]: Finished difference Result 2194 states and 3255 transitions. [2018-12-09 01:41:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:41:25,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-12-09 01:41:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:25,854 INFO L225 Difference]: With dead ends: 2194 [2018-12-09 01:41:25,854 INFO L226 Difference]: Without dead ends: 1646 [2018-12-09 01:41:25,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2018-12-09 01:41:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1464. [2018-12-09 01:41:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-12-09 01:41:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2038 transitions. [2018-12-09 01:41:25,894 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2038 transitions. Word has length 175 [2018-12-09 01:41:25,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:25,895 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2038 transitions. [2018-12-09 01:41:25,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:41:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2038 transitions. [2018-12-09 01:41:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-09 01:41:25,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:25,901 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:25,901 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:25,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash 338201322, now seen corresponding path program 1 times [2018-12-09 01:41:25,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:25,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:25,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:25,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:25,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:41:26,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:26,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:41:26,056 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-12-09 01:41:26,057 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:41:26,085 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:41:26,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:41:26,315 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 01:41:26,316 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Performed 1024 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1024 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 24 variables. [2018-12-09 01:41:26,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:26,322 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 01:41:26,580 INFO L227 lantSequenceWeakener]: Weakened 248 states. On average, predicates are now at 78.1% of their original sizes. [2018-12-09 01:41:26,580 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 01:41:26,603 INFO L418 sIntCurrentIteration]: We unified 256 AI predicates to 256 [2018-12-09 01:41:26,603 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 01:41:26,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:41:26,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-09 01:41:26,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:41:26,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:41:26,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:41:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:41:26,605 INFO L87 Difference]: Start difference. First operand 1464 states and 2038 transitions. Second operand 6 states. [2018-12-09 01:41:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:39,372 INFO L93 Difference]: Finished difference Result 3105 states and 4296 transitions. [2018-12-09 01:41:39,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:41:39,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2018-12-09 01:41:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:39,377 INFO L225 Difference]: With dead ends: 3105 [2018-12-09 01:41:39,377 INFO L226 Difference]: Without dead ends: 1647 [2018-12-09 01:41:39,379 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 257 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:41:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2018-12-09 01:41:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1646. [2018-12-09 01:41:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2018-12-09 01:41:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2227 transitions. [2018-12-09 01:41:39,412 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2227 transitions. Word has length 257 [2018-12-09 01:41:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:39,412 INFO L480 AbstractCegarLoop]: Abstraction has 1646 states and 2227 transitions. [2018-12-09 01:41:39,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:41:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2227 transitions. [2018-12-09 01:41:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-12-09 01:41:39,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:39,418 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-12-09 01:41:39,419 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:39,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:39,419 INFO L82 PathProgramCache]: Analyzing trace with hash 895332674, now seen corresponding path program 1 times [2018-12-09 01:41:39,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:41:39,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:39,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:39,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:39,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:41:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 253 proven. 161 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:41:39,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:41:39,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:41:39,794 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 342 with the following transitions: [2018-12-09 01:41:39,795 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:41:39,797 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:41:39,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:41:39,905 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 01:41:39,906 INFO L272 AbstractInterpreter]: Visited 120 different actions 233 times. Merged at 3 different actions 3 times. Never widened. Performed 2103 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2103 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-09 01:41:39,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:39,908 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 01:41:40,126 INFO L227 lantSequenceWeakener]: Weakened 338 states. On average, predicates are now at 77.94% of their original sizes. [2018-12-09 01:41:40,126 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 01:41:40,188 INFO L418 sIntCurrentIteration]: We unified 340 AI predicates to 340 [2018-12-09 01:41:40,188 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 01:41:40,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:41:40,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2018-12-09 01:41:40,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:41:40,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:41:40,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:41:40,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:41:40,189 INFO L87 Difference]: Start difference. First operand 1646 states and 2227 transitions. Second operand 10 states. [2018-12-09 01:42:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:25,484 INFO L93 Difference]: Finished difference Result 3684 states and 4968 transitions. [2018-12-09 01:42:25,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 01:42:25,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 341 [2018-12-09 01:42:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:25,488 INFO L225 Difference]: With dead ends: 3684 [2018-12-09 01:42:25,488 INFO L226 Difference]: Without dead ends: 2226 [2018-12-09 01:42:25,490 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 349 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:42:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2018-12-09 01:42:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2012. [2018-12-09 01:42:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2018-12-09 01:42:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2651 transitions. [2018-12-09 01:42:25,517 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2651 transitions. Word has length 341 [2018-12-09 01:42:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:25,517 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 2651 transitions. [2018-12-09 01:42:25,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:42:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2651 transitions. [2018-12-09 01:42:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-12-09 01:42:25,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:25,521 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 01:42:25,522 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:25,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:25,522 INFO L82 PathProgramCache]: Analyzing trace with hash -825639, now seen corresponding path program 1 times [2018-12-09 01:42:25,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:25,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:25,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 179 proven. 267 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:42:26,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:26,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:26,069 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 393 with the following transitions: [2018-12-09 01:42:26,070 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:42:26,072 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:42:26,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:42:26,243 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 01:42:26,243 INFO L272 AbstractInterpreter]: Visited 142 different actions 278 times. Merged at 4 different actions 4 times. Never widened. Performed 2658 root evaluator evaluations with a maximum evaluation depth of 13. Performed 2658 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-09 01:42:26,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:26,244 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 01:42:26,449 INFO L227 lantSequenceWeakener]: Weakened 389 states. On average, predicates are now at 77.85% of their original sizes. [2018-12-09 01:42:26,449 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 01:42:26,483 INFO L418 sIntCurrentIteration]: We unified 391 AI predicates to 391 [2018-12-09 01:42:26,484 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 01:42:26,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:42:26,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2018-12-09 01:42:26,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:42:26,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:42:26,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:42:26,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:42:26,485 INFO L87 Difference]: Start difference. First operand 2012 states and 2651 transitions. Second operand 10 states. [2018-12-09 01:42:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:36,576 INFO L93 Difference]: Finished difference Result 4386 states and 5709 transitions. [2018-12-09 01:42:36,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:42:36,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 392 [2018-12-09 01:42:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:36,580 INFO L225 Difference]: With dead ends: 4386 [2018-12-09 01:42:36,581 INFO L226 Difference]: Without dead ends: 2380 [2018-12-09 01:42:36,582 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 399 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-09 01:42:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2018-12-09 01:42:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2378. [2018-12-09 01:42:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2018-12-09 01:42:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3039 transitions. [2018-12-09 01:42:36,607 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3039 transitions. Word has length 392 [2018-12-09 01:42:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:36,607 INFO L480 AbstractCegarLoop]: Abstraction has 2378 states and 3039 transitions. [2018-12-09 01:42:36,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:42:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3039 transitions. [2018-12-09 01:42:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-12-09 01:42:36,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:36,611 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:42:36,612 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:36,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash 62409986, now seen corresponding path program 1 times [2018-12-09 01:42:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:36,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:36,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:36,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:36,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 304 proven. 124 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-09 01:42:36,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:36,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:36,805 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 394 with the following transitions: [2018-12-09 01:42:36,806 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:42:36,807 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:42:36,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:42:40,170 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 01:42:40,170 INFO L272 AbstractInterpreter]: Visited 120 different actions 357 times. Merged at 6 different actions 17 times. Never widened. Performed 3420 root evaluator evaluations with a maximum evaluation depth of 21. Performed 3420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-09 01:42:40,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:40,172 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 01:42:40,757 INFO L227 lantSequenceWeakener]: Weakened 390 states. On average, predicates are now at 80.48% of their original sizes. [2018-12-09 01:42:40,757 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 01:42:40,800 INFO L418 sIntCurrentIteration]: We unified 392 AI predicates to 392 [2018-12-09 01:42:40,800 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 01:42:40,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:42:40,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-12-09 01:42:40,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:42:40,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:42:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:42:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:42:40,801 INFO L87 Difference]: Start difference. First operand 2378 states and 3039 transitions. Second operand 10 states. [2018-12-09 01:42:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:42:56,114 INFO L93 Difference]: Finished difference Result 5153 states and 6965 transitions. [2018-12-09 01:42:56,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 01:42:56,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 393 [2018-12-09 01:42:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:42:56,121 INFO L225 Difference]: With dead ends: 5153 [2018-12-09 01:42:56,122 INFO L226 Difference]: Without dead ends: 3147 [2018-12-09 01:42:56,124 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 403 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-12-09 01:42:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-12-09 01:42:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3124. [2018-12-09 01:42:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2018-12-09 01:42:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4008 transitions. [2018-12-09 01:42:56,162 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4008 transitions. Word has length 393 [2018-12-09 01:42:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:42:56,162 INFO L480 AbstractCegarLoop]: Abstraction has 3124 states and 4008 transitions. [2018-12-09 01:42:56,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:42:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4008 transitions. [2018-12-09 01:42:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-12-09 01:42:56,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:42:56,166 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:42:56,166 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:42:56,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:42:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1394222806, now seen corresponding path program 1 times [2018-12-09 01:42:56,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:42:56,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:56,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:42:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:42:56,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:42:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:42:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 531 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-12-09 01:42:56,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:42:56,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:42:56,313 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 478 with the following transitions: [2018-12-09 01:42:56,313 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:42:56,314 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:42:56,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:02,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:02,617 INFO L272 AbstractInterpreter]: Visited 122 different actions 491 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Performed 4679 root evaluator evaluations with a maximum evaluation depth of 21. Performed 4679 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 9 fixpoints after 3 different actions. Largest state had 24 variables. [2018-12-09 01:43:02,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:02,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:02,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:02,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:02,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:02,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:02,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 531 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-12-09 01:43:02,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 531 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-12-09 01:43:03,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:43:03,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-12-09 01:43:03,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:43:03,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:43:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:43:03,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:43:03,004 INFO L87 Difference]: Start difference. First operand 3124 states and 4008 transitions. Second operand 9 states. [2018-12-09 01:43:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:05,382 INFO L93 Difference]: Finished difference Result 8262 states and 11584 transitions. [2018-12-09 01:43:05,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 01:43:05,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 477 [2018-12-09 01:43:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:05,394 INFO L225 Difference]: With dead ends: 8262 [2018-12-09 01:43:05,394 INFO L226 Difference]: Without dead ends: 5326 [2018-12-09 01:43:05,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 974 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=1237, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 01:43:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5326 states. [2018-12-09 01:43:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5326 to 4544. [2018-12-09 01:43:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2018-12-09 01:43:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6015 transitions. [2018-12-09 01:43:05,462 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6015 transitions. Word has length 477 [2018-12-09 01:43:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:05,463 INFO L480 AbstractCegarLoop]: Abstraction has 4544 states and 6015 transitions. [2018-12-09 01:43:05,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:43:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6015 transitions. [2018-12-09 01:43:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2018-12-09 01:43:05,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:05,467 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:05,467 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:05,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1836091141, now seen corresponding path program 1 times [2018-12-09 01:43:05,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:05,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 661 proven. 2 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-12-09 01:43:05,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:05,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:05,639 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 549 with the following transitions: [2018-12-09 01:43:05,639 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:05,641 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:05,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:09,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:09,440 INFO L272 AbstractInterpreter]: Visited 123 different actions 487 times. Merged at 9 different actions 28 times. Never widened. Performed 4696 root evaluator evaluations with a maximum evaluation depth of 21. Performed 4696 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-09 01:43:09,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:09,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:09,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:09,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:09,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:09,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:09,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 661 proven. 2 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-12-09 01:43:09,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 661 proven. 2 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-12-09 01:43:09,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:43:09,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-12-09 01:43:09,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:43:09,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:43:09,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:43:09,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:43:09,769 INFO L87 Difference]: Start difference. First operand 4544 states and 6015 transitions. Second operand 9 states. [2018-12-09 01:43:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:10,964 INFO L93 Difference]: Finished difference Result 9838 states and 13740 transitions. [2018-12-09 01:43:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:43:10,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 548 [2018-12-09 01:43:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:10,977 INFO L225 Difference]: With dead ends: 9838 [2018-12-09 01:43:10,977 INFO L226 Difference]: Without dead ends: 5082 [2018-12-09 01:43:10,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1117 GetRequests, 1099 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:43:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2018-12-09 01:43:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 4968. [2018-12-09 01:43:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4968 states. [2018-12-09 01:43:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 6503 transitions. [2018-12-09 01:43:11,047 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 6503 transitions. Word has length 548 [2018-12-09 01:43:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:11,048 INFO L480 AbstractCegarLoop]: Abstraction has 4968 states and 6503 transitions. [2018-12-09 01:43:11,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:43:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 6503 transitions. [2018-12-09 01:43:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-12-09 01:43:11,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:11,052 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:11,052 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:11,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1391528455, now seen corresponding path program 1 times [2018-12-09 01:43:11,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:11,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:11,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 591 proven. 409 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-09 01:43:11,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:11,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:11,582 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 553 with the following transitions: [2018-12-09 01:43:11,583 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:11,584 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:11,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:18,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:18,561 INFO L272 AbstractInterpreter]: Visited 124 different actions 487 times. Merged at 8 different actions 24 times. Never widened. Performed 4754 root evaluator evaluations with a maximum evaluation depth of 22. Performed 4754 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 8 fixpoints after 3 different actions. Largest state had 24 variables. [2018-12-09 01:43:18,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:18,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:18,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:18,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:18,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:18,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:18,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-12-09 01:43:18,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-12-09 01:43:18,858 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:43:18,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [14] total 16 [2018-12-09 01:43:18,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:43:18,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:43:18,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:43:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:43:18,859 INFO L87 Difference]: Start difference. First operand 4968 states and 6503 transitions. Second operand 3 states. [2018-12-09 01:43:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:19,250 INFO L93 Difference]: Finished difference Result 11426 states and 15320 transitions. [2018-12-09 01:43:19,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:43:19,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 552 [2018-12-09 01:43:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:19,264 INFO L225 Difference]: With dead ends: 11426 [2018-12-09 01:43:19,264 INFO L226 Difference]: Without dead ends: 6646 [2018-12-09 01:43:19,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 1105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:43:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2018-12-09 01:43:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 6090. [2018-12-09 01:43:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2018-12-09 01:43:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 7911 transitions. [2018-12-09 01:43:19,339 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 7911 transitions. Word has length 552 [2018-12-09 01:43:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:19,339 INFO L480 AbstractCegarLoop]: Abstraction has 6090 states and 7911 transitions. [2018-12-09 01:43:19,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:43:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 7911 transitions. [2018-12-09 01:43:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-12-09 01:43:19,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:19,344 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:19,344 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:19,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:19,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1555970989, now seen corresponding path program 1 times [2018-12-09 01:43:19,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:19,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:19,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:19,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:19,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 576 proven. 427 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-12-09 01:43:19,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:19,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:19,865 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 561 with the following transitions: [2018-12-09 01:43:19,866 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [598], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [662], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:19,867 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:19,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:23,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:23,644 INFO L272 AbstractInterpreter]: Visited 123 different actions 491 times. Merged at 9 different actions 32 times. Never widened. Performed 4734 root evaluator evaluations with a maximum evaluation depth of 21. Performed 4734 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 8 fixpoints after 3 different actions. Largest state had 24 variables. [2018-12-09 01:43:23,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:23,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:23,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:23,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:23,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:23,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:23,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 673 proven. 2 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-09 01:43:23,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 673 proven. 2 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-09 01:43:24,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:43:24,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-12-09 01:43:24,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:43:24,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 01:43:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 01:43:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:43:24,006 INFO L87 Difference]: Start difference. First operand 6090 states and 7911 transitions. Second operand 17 states. [2018-12-09 01:43:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:26,195 INFO L93 Difference]: Finished difference Result 10873 states and 14825 transitions. [2018-12-09 01:43:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-09 01:43:26,196 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 560 [2018-12-09 01:43:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:26,204 INFO L225 Difference]: With dead ends: 10873 [2018-12-09 01:43:26,204 INFO L226 Difference]: Without dead ends: 3945 [2018-12-09 01:43:26,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1138 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=819, Invalid=2963, Unknown=0, NotChecked=0, Total=3782 [2018-12-09 01:43:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2018-12-09 01:43:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3570. [2018-12-09 01:43:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3570 states. [2018-12-09 01:43:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 3876 transitions. [2018-12-09 01:43:26,254 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 3876 transitions. Word has length 560 [2018-12-09 01:43:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:26,254 INFO L480 AbstractCegarLoop]: Abstraction has 3570 states and 3876 transitions. [2018-12-09 01:43:26,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 01:43:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 3876 transitions. [2018-12-09 01:43:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-12-09 01:43:26,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:26,258 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:26,258 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:26,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash -429236790, now seen corresponding path program 1 times [2018-12-09 01:43:26,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:26,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:26,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 707 proven. 2 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2018-12-09 01:43:26,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:26,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:26,528 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 740 with the following transitions: [2018-12-09 01:43:26,528 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [638], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [910], [911], [915], [919], [923], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:26,530 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:26,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:30,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:30,420 INFO L272 AbstractInterpreter]: Visited 191 different actions 763 times. Merged at 9 different actions 32 times. Never widened. Performed 8385 root evaluator evaluations with a maximum evaluation depth of 21. Performed 8385 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 9 fixpoints after 4 different actions. Largest state had 24 variables. [2018-12-09 01:43:30,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:30,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:30,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:30,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:30,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:30,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:30,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 707 proven. 2 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2018-12-09 01:43:30,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 707 proven. 2 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2018-12-09 01:43:30,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:43:30,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2018-12-09 01:43:30,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:43:30,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:43:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:43:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:43:30,883 INFO L87 Difference]: Start difference. First operand 3570 states and 3876 transitions. Second operand 10 states. [2018-12-09 01:43:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:31,764 INFO L93 Difference]: Finished difference Result 8270 states and 9156 transitions. [2018-12-09 01:43:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 01:43:31,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 739 [2018-12-09 01:43:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:31,771 INFO L225 Difference]: With dead ends: 8270 [2018-12-09 01:43:31,771 INFO L226 Difference]: Without dead ends: 4886 [2018-12-09 01:43:31,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1484 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-12-09 01:43:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2018-12-09 01:43:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4704. [2018-12-09 01:43:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4704 states. [2018-12-09 01:43:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 5093 transitions. [2018-12-09 01:43:31,826 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 5093 transitions. Word has length 739 [2018-12-09 01:43:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:31,827 INFO L480 AbstractCegarLoop]: Abstraction has 4704 states and 5093 transitions. [2018-12-09 01:43:31,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:43:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 5093 transitions. [2018-12-09 01:43:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2018-12-09 01:43:31,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:31,832 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:31,832 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:31,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2068688985, now seen corresponding path program 1 times [2018-12-09 01:43:31,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:31,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:31,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 866 proven. 2 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2018-12-09 01:43:32,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:32,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:32,103 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 825 with the following transitions: [2018-12-09 01:43:32,104 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [662], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [910], [911], [915], [919], [923], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:32,105 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:32,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:35,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:35,993 INFO L272 AbstractInterpreter]: Visited 192 different actions 766 times. Merged at 10 different actions 31 times. Never widened. Performed 8434 root evaluator evaluations with a maximum evaluation depth of 21. Performed 8434 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 10 fixpoints after 5 different actions. Largest state had 24 variables. [2018-12-09 01:43:35,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:35,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:35,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:35,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:36,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:36,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:36,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 866 proven. 2 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2018-12-09 01:43:36,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 866 proven. 2 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2018-12-09 01:43:36,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:43:36,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-09 01:43:36,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:43:36,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:43:36,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:43:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:43:36,518 INFO L87 Difference]: Start difference. First operand 4704 states and 5093 transitions. Second operand 6 states. [2018-12-09 01:43:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:37,098 INFO L93 Difference]: Finished difference Result 8260 states and 8865 transitions. [2018-12-09 01:43:37,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:43:37,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 824 [2018-12-09 01:43:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:37,104 INFO L225 Difference]: With dead ends: 8260 [2018-12-09 01:43:37,104 INFO L226 Difference]: Without dead ends: 3730 [2018-12-09 01:43:37,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1662 GetRequests, 1649 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:43:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2018-12-09 01:43:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3160. [2018-12-09 01:43:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3160 states. [2018-12-09 01:43:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 3264 transitions. [2018-12-09 01:43:37,145 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 3264 transitions. Word has length 824 [2018-12-09 01:43:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:37,146 INFO L480 AbstractCegarLoop]: Abstraction has 3160 states and 3264 transitions. [2018-12-09 01:43:37,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:43:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 3264 transitions. [2018-12-09 01:43:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2018-12-09 01:43:37,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:37,150 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:37,150 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:37,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:37,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1082900759, now seen corresponding path program 1 times [2018-12-09 01:43:37,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:37,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:37,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:37,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:37,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 697 proven. 840 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-09 01:43:38,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:38,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:38,115 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 833 with the following transitions: [2018-12-09 01:43:38,115 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [910], [911], [915], [919], [923], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:38,117 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:38,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:42,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:42,012 INFO L272 AbstractInterpreter]: Visited 192 different actions 771 times. Merged at 10 different actions 36 times. Widened at 1 different actions 2 times. Performed 8497 root evaluator evaluations with a maximum evaluation depth of 21. Performed 8497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 10 fixpoints after 3 different actions. Largest state had 24 variables. [2018-12-09 01:43:42,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:42,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:42,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:42,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:42,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:42,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 1391 proven. 2 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2018-12-09 01:43:42,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 756 proven. 196 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2018-12-09 01:43:42,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:43:42,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2018-12-09 01:43:42,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:43:42,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 01:43:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 01:43:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:43:42,870 INFO L87 Difference]: Start difference. First operand 3160 states and 3264 transitions. Second operand 16 states. [2018-12-09 01:43:45,488 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-09 01:43:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:46,458 INFO L93 Difference]: Finished difference Result 5586 states and 5791 transitions. [2018-12-09 01:43:46,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 01:43:46,459 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 832 [2018-12-09 01:43:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:46,467 INFO L225 Difference]: With dead ends: 5586 [2018-12-09 01:43:46,468 INFO L226 Difference]: Without dead ends: 3356 [2018-12-09 01:43:46,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1726 GetRequests, 1680 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=466, Invalid=1790, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 01:43:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2018-12-09 01:43:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3340. [2018-12-09 01:43:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3340 states. [2018-12-09 01:43:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 3447 transitions. [2018-12-09 01:43:46,510 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 3447 transitions. Word has length 832 [2018-12-09 01:43:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:46,510 INFO L480 AbstractCegarLoop]: Abstraction has 3340 states and 3447 transitions. [2018-12-09 01:43:46,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 01:43:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 3447 transitions. [2018-12-09 01:43:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2018-12-09 01:43:46,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:46,515 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:46,515 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:46,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1676542447, now seen corresponding path program 1 times [2018-12-09 01:43:46,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:46,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:46,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:46,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:46,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 660 proven. 224 refuted. 0 times theorem prover too weak. 1478 trivial. 0 not checked. [2018-12-09 01:43:46,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:46,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:46,787 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 853 with the following transitions: [2018-12-09 01:43:46,788 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [686], [687], [691], [694], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:46,789 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:46,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:50,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:50,695 INFO L272 AbstractInterpreter]: Visited 193 different actions 776 times. Merged at 10 different actions 37 times. Widened at 1 different actions 1 times. Performed 8535 root evaluator evaluations with a maximum evaluation depth of 21. Performed 8535 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 12 fixpoints after 5 different actions. Largest state had 24 variables. [2018-12-09 01:43:50,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:50,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:50,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:50,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:50,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:50,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:50,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1590 proven. 2 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-09 01:43:51,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 660 proven. 224 refuted. 0 times theorem prover too weak. 1478 trivial. 0 not checked. [2018-12-09 01:43:51,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:43:51,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-12-09 01:43:51,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:43:51,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:43:51,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:43:51,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:43:51,282 INFO L87 Difference]: Start difference. First operand 3340 states and 3447 transitions. Second operand 7 states. [2018-12-09 01:43:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:51,658 INFO L93 Difference]: Finished difference Result 5940 states and 6149 transitions. [2018-12-09 01:43:51,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:43:51,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 852 [2018-12-09 01:43:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:51,663 INFO L225 Difference]: With dead ends: 5940 [2018-12-09 01:43:51,663 INFO L226 Difference]: Without dead ends: 3712 [2018-12-09 01:43:51,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1714 GetRequests, 1703 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:43:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2018-12-09 01:43:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3704. [2018-12-09 01:43:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3704 states. [2018-12-09 01:43:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 3825 transitions. [2018-12-09 01:43:51,697 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 3825 transitions. Word has length 852 [2018-12-09 01:43:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:51,697 INFO L480 AbstractCegarLoop]: Abstraction has 3704 states and 3825 transitions. [2018-12-09 01:43:51,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:43:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 3825 transitions. [2018-12-09 01:43:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2018-12-09 01:43:51,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:51,702 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-12-09 01:43:51,702 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:51,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:51,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1431515303, now seen corresponding path program 1 times [2018-12-09 01:43:51,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:51,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:51,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 644 proven. 445 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2018-12-09 01:43:52,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:52,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:52,272 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 913 with the following transitions: [2018-12-09 01:43:52,272 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [926], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:52,273 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:52,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:43:56,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:43:56,174 INFO L272 AbstractInterpreter]: Visited 193 different actions 771 times. Merged at 9 different actions 32 times. Widened at 1 different actions 1 times. Performed 8491 root evaluator evaluations with a maximum evaluation depth of 21. Performed 8491 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 12 fixpoints after 6 different actions. Largest state had 24 variables. [2018-12-09 01:43:56,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:56,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:43:56,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:56,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:43:56,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:56,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:43:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:56,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 1017 proven. 2 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2018-12-09 01:43:56,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:43:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2424 backedges. 1017 proven. 2 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2018-12-09 01:43:57,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:43:57,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2018-12-09 01:43:57,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:43:57,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:43:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:43:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:43:57,266 INFO L87 Difference]: Start difference. First operand 3704 states and 3825 transitions. Second operand 10 states. [2018-12-09 01:43:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:58,382 INFO L93 Difference]: Finished difference Result 7404 states and 7649 transitions. [2018-12-09 01:43:58,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 01:43:58,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 912 [2018-12-09 01:43:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:58,387 INFO L225 Difference]: With dead ends: 7404 [2018-12-09 01:43:58,387 INFO L226 Difference]: Without dead ends: 2772 [2018-12-09 01:43:58,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1863 GetRequests, 1833 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2018-12-09 01:43:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2018-12-09 01:43:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2586. [2018-12-09 01:43:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2018-12-09 01:43:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 2629 transitions. [2018-12-09 01:43:58,416 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 2629 transitions. Word has length 912 [2018-12-09 01:43:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:58,417 INFO L480 AbstractCegarLoop]: Abstraction has 2586 states and 2629 transitions. [2018-12-09 01:43:58,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:43:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 2629 transitions. [2018-12-09 01:43:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2018-12-09 01:43:58,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:58,424 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:58,424 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:58,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:58,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2043956975, now seen corresponding path program 1 times [2018-12-09 01:43:58,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:43:58,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:58,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:58,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:58,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:43:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 1837 proven. 355 refuted. 0 times theorem prover too weak. 1947 trivial. 0 not checked. [2018-12-09 01:43:59,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:59,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:43:59,004 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 1159 with the following transitions: [2018-12-09 01:43:59,004 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [686], [687], [691], [694], [695], [699], [703], [707], [711], [715], [719], [723], [726], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [926], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:43:59,005 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:43:59,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:44:02,917 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:44:02,918 INFO L272 AbstractInterpreter]: Visited 195 different actions 783 times. Merged at 11 different actions 36 times. Widened at 1 different actions 1 times. Performed 8668 root evaluator evaluations with a maximum evaluation depth of 21. Performed 8668 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 16 fixpoints after 7 different actions. Largest state had 24 variables. [2018-12-09 01:44:02,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:02,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:44:02,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:02,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:44:02,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:02,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:44:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:03,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 2602 proven. 6 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2018-12-09 01:44:03,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 1837 proven. 359 refuted. 0 times theorem prover too weak. 1943 trivial. 0 not checked. [2018-12-09 01:44:04,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:44:04,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2018-12-09 01:44:04,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:44:04,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:44:04,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:44:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:44:04,003 INFO L87 Difference]: Start difference. First operand 2586 states and 2629 transitions. Second operand 9 states. [2018-12-09 01:44:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:04,587 INFO L93 Difference]: Finished difference Result 4090 states and 4176 transitions. [2018-12-09 01:44:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:44:04,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1158 [2018-12-09 01:44:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:04,591 INFO L225 Difference]: With dead ends: 4090 [2018-12-09 01:44:04,591 INFO L226 Difference]: Without dead ends: 2984 [2018-12-09 01:44:04,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2336 GetRequests, 2315 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2018-12-09 01:44:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2018-12-09 01:44:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2770. [2018-12-09 01:44:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2018-12-09 01:44:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 2814 transitions. [2018-12-09 01:44:04,614 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 2814 transitions. Word has length 1158 [2018-12-09 01:44:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:04,614 INFO L480 AbstractCegarLoop]: Abstraction has 2770 states and 2814 transitions. [2018-12-09 01:44:04,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:44:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 2814 transitions. [2018-12-09 01:44:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1712 [2018-12-09 01:44:04,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:04,626 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:04,626 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:04,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:04,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2024251614, now seen corresponding path program 1 times [2018-12-09 01:44:04,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:44:04,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:04,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:04,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:04,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:44:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9098 backedges. 1999 proven. 5464 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2018-12-09 01:44:07,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:07,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:44:07,763 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 1712 with the following transitions: [2018-12-09 01:44:07,763 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [670], [671], [675], [679], [683], [686], [687], [690], [691], [694], [695], [699], [703], [707], [711], [715], [719], [723], [726], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [778], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [926], [927], [931], [934], [935], [939], [943], [946], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-09 01:44:07,764 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:44:07,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:44:11,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:44:11,687 INFO L272 AbstractInterpreter]: Visited 202 different actions 807 times. Merged at 12 different actions 32 times. Never widened. Performed 9014 root evaluator evaluations with a maximum evaluation depth of 21. Performed 9014 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 20 fixpoints after 10 different actions. Largest state had 24 variables. [2018-12-09 01:44:11,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:11,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:44:11,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:11,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/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 01:44:11,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:11,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:44:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:11,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9098 backedges. 3072 proven. 124 refuted. 0 times theorem prover too weak. 5902 trivial. 0 not checked. [2018-12-09 01:44:12,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:44:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9098 backedges. 3112 proven. 197 refuted. 0 times theorem prover too weak. 5789 trivial. 0 not checked. [2018-12-09 01:44:14,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:44:14,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 10] total 41 [2018-12-09 01:44:14,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:44:14,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 01:44:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 01:44:14,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1453, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 01:44:14,367 INFO L87 Difference]: Start difference. First operand 2770 states and 2814 transitions. Second operand 34 states. [2018-12-09 01:44:17,008 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-09 01:44:17,215 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2018-12-09 01:44:23,751 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2018-12-09 01:44:23,958 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2018-12-09 01:44:26,157 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-12-09 01:44:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:28,421 INFO L93 Difference]: Finished difference Result 4302 states and 4411 transitions. [2018-12-09 01:44:28,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-09 01:44:28,421 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1711 [2018-12-09 01:44:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:28,422 INFO L225 Difference]: With dead ends: 4302 [2018-12-09 01:44:28,423 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:44:28,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3548 GetRequests, 3437 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3174 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2240, Invalid=9750, Unknown=0, NotChecked=0, Total=11990 [2018-12-09 01:44:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:44:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:44:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:44:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:44:28,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1711 [2018-12-09 01:44:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:28,428 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:44:28,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 01:44:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:44:28,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:44:28,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 01:44:28,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:28,973 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 349 [2018-12-09 01:44:29,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:29,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:29,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:29,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:29,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:29,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 01:44:29,266 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 431 DAG size of output: 339 [2018-12-09 01:44:30,785 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 360 DAG size of output: 133 [2018-12-09 01:44:32,653 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 342 DAG size of output: 104 [2018-12-09 01:44:33,788 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 336 DAG size of output: 106 [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-12-09 01:44:33,790 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,791 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,792 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-09 01:44:33,793 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse18 (= ~a12~0 |old(~a12~0)|)) (.cse19 (= ~a15~0 |old(~a15~0)|)) (.cse2 (= 6 |old(~a21~0)|)) (.cse24 (< 7 |old(~a15~0)|)) (.cse3 (<= |old(~a12~0)| ~a12~0)) (.cse33 (= 1 ~a24~0)) (.cse11 (= 10 |old(~a21~0)|)) (.cse6 (< 80 |old(~a12~0)|)) (.cse22 (< |old(~a21~0)| 10)) (.cse8 (not (= 1 |old(~a24~0)|))) (.cse9 (not (= 8 |old(~a15~0)|))) (.cse0 (<= ~a12~0 |old(~a12~0)|)) (.cse15 (= ~a24~0 |old(~a24~0)|)) (.cse4 (= ~a21~0 |old(~a21~0)|)) (.cse1 (= |old(~a15~0)| ~a15~0)) (.cse7 (= 0 |old(~a21~0)|)) (.cse27 (< |old(~a12~0)| 81)) (.cse10 (= |calculate_output_#in~input| 0))) (let ((.cse17 (or .cse7 .cse27 (< 8 |old(~a21~0)|) .cse10)) (.cse5 (= ~a24~0 1)) (.cse23 (and .cse0 .cse15 .cse4 .cse1)) (.cse26 (and (or (or (not .cse11) .cse9) .cse8 .cse10) (or .cse6 .cse22 .cse8 .cse9 .cse10))) (.cse16 (< 11 |old(~a12~0)|)) (.cse28 (not (= 7 |old(~a21~0)|))) (.cse12 (not (= 5 |old(~a15~0)|))) (.cse14 (and .cse0 (= 5 ~a15~0))) (.cse21 (and .cse0 .cse3 .cse4 .cse33 (= 9 ~a15~0))) (.cse20 (not (= 9 |old(~a15~0)|))) (.cse25 (not (= 8 |old(~a21~0)|))) (.cse29 (< |old(~a21~0)| 9)) (.cse30 (<= |old(~a12~0)| 80)) (.cse31 (or .cse8 .cse24)) (.cse13 (not .cse2)) (.cse32 (and (and .cse18 .cse33 (<= ~a15~0 7)) .cse4 .cse19))) (and (or (not (= 6 |old(~a15~0)|)) (and .cse0 .cse1)) (or .cse2 (and .cse0 .cse3 .cse4 (= 8 ~a15~0) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (and .cse3 .cse14 .cse15 .cse4) .cse16) (or .cse17 .cse13 (and (and .cse18 .cse5) .cse4 .cse19) .cse8 .cse9) (or .cse13 .cse20 .cse21 .cse8 (< 95434 |old(~a12~0)|) (<= |old(~a12~0)| 95380)) (or .cse20 .cse22 .cse21 .cse8 .cse16) (or .cse8 .cse23 .cse24 .cse25) (or .cse6 .cse8 .cse23 .cse24) (or .cse17 .cse8 .cse9 (< 73282 |old(~a12~0)|) (and .cse18 .cse4 .cse1 .cse5)) (or .cse26 .cse27 (and .cse18 (and .cse5 .cse1) .cse4)) (or .cse20 .cse28 .cse27 .cse8 .cse21) (or .cse21 .cse20 .cse8 .cse16 .cse25) (or .cse22 .cse8 .cse24 .cse23) (or (or .cse20 .cse8) (< 72 |old(~a12~0)|) .cse21 (<= |old(~a12~0)| 18) .cse25) (or .cse29 .cse20 .cse21 .cse8 .cse30) (or .cse26 (and .cse3 .cse4 (and .cse0 .cse15 .cse1)) .cse16) (or .cse31 .cse18 (< 0 (+ |old(~a12~0)| 460233)) .cse28) (or .cse12 (and .cse14 .cse15 .cse4) .cse8) (or .cse21 .cse20 .cse27 .cse8 .cse25) (or .cse31 .cse29 .cse30 .cse32 .cse11) (or .cse31 .cse13 .cse32)))) [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-12-09 01:44:33,794 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,795 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-09 01:44:33,796 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,797 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-09 01:44:33,798 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-12-09 01:44:33,799 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 8 ~a15~0) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) [2018-12-09 01:44:33,800 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= 8 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (not (= 0 (+ |old(~a12~0)| 49))) (and (= 7 ~a21~0) (<= |old(~a12~0)| ~a12~0) (<= (+ ~a12~0 49) 0) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1))) [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-12-09 01:44:33,800 INFO L444 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse16 (<= ~a12~0 80)) (.cse21 (not (= ~a21~0 0))) (.cse18 (not (= main_~input~0 0))) (.cse19 (= ~a15~0 8)) (.cse20 (= ~a24~0 1))) (let ((.cse15 (and .cse16 .cse21 .cse18 .cse19 .cse20)) (.cse13 (<= 10 ~a21~0)) (.cse6 (= ~a24~0 |old(~a24~0)|)) (.cse0 (<= 81 ~a12~0)) (.cse17 (<= ~a15~0 |old(~a15~0)|)) (.cse1 (= 1 ~a24~0)) (.cse14 (<= ~a15~0 7))) (let ((.cse5 (= 5 ~a15~0)) (.cse9 (= ~a21~0 6)) (.cse11 (and .cse1 .cse14 (or (not (= 6 |old(~a21~0)|)) (not (= 5 |old(~a15~0)|))))) (.cse2 (= ~a21~0 8)) (.cse4 (= 6 ~a21~0)) (.cse12 (and .cse0 (<= ~a21~0 8) (<= |old(~a12~0)| 11) (and .cse21 .cse18) .cse17)) (.cse10 (<= 9 ~a21~0)) (.cse3 (= 9 ~a15~0)) (.cse7 (or (and .cse15 .cse13 .cse17 .cse6) (and .cse17 .cse6 (and .cse18 (and .cse19 (= ~a21~0 10)) .cse20)))) (.cse8 (<= ~a12~0 11))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 8 |old(~a15~0)|)) (and .cse4 (<= ~a12~0 95434) .cse1 .cse3 (< 95380 ~a12~0)) (and .cse5 .cse6) (and .cse0 .cse7) (not (= 7 |old(~a21~0)|)) (and .cse8 (and .cse9 .cse5)) (and .cse10 .cse11) (not (= 0 (+ |old(~a12~0)| 49))) (and (<= ~a12~0 73282) .cse12 .cse1 (= 8 ~a15~0)) (and .cse13 .cse1 .cse8 .cse3) (and .cse2 .cse1 .cse8 .cse3) (and .cse1 .cse14 .cse2) (and .cse9 .cse11) (and (< 18 ~a12~0) .cse6 (<= ~a12~0 72) (and .cse2 .cse3)) (and (not (= 10 ~a21~0)) .cse15 (not .cse4)) (and .cse4 .cse12 .cse6) (= 6 ~a15~0) (and .cse16 .cse1 .cse14) (and (= 7 ~a21~0) (and .cse0 .cse1 .cse3)) (and .cse10 .cse1 (< 80 ~a12~0) .cse3) (not (= 1 |old(~a24~0)|)) (and .cse7 .cse8))))) [2018-12-09 01:44:33,800 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-12-09 01:44:33,801 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-12-09 01:44:33,801 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse16 (<= ~a12~0 80)) (.cse17 (not (= ~a21~0 0))) (.cse20 (= ~a15~0 8))) (let ((.cse0 (<= 81 ~a12~0)) (.cse18 (= ~a24~0 1)) (.cse13 (and .cse16 .cse17 .cse20)) (.cse12 (<= 10 ~a21~0)) (.cse6 (= ~a24~0 |old(~a24~0)|)) (.cse1 (= 1 ~a24~0)) (.cse15 (<= ~a15~0 7))) (let ((.cse5 (= 5 ~a15~0)) (.cse8 (<= ~a12~0 11)) (.cse9 (= ~a21~0 6)) (.cse11 (and .cse1 .cse15 (or (not (= 6 |old(~a21~0)|)) (not (= 5 |old(~a15~0)|))))) (.cse14 (let ((.cse19 (<= ~a15~0 |old(~a15~0)|))) (or (and .cse19 (and .cse20 .cse18 (= ~a21~0 10))) (and .cse13 .cse12 .cse19 .cse6)))) (.cse2 (= ~a21~0 8)) (.cse10 (<= 9 ~a21~0)) (.cse3 (= 9 ~a15~0)) (.cse4 (= 6 ~a21~0)) (.cse7 (and .cse0 (<= ~a21~0 8) (<= |old(~a12~0)| 11) .cse6 (and .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 8 |old(~a15~0)|)) (and .cse4 (<= ~a12~0 95434) .cse1 .cse3 (< 95380 ~a12~0)) (and .cse5 .cse6) (and (<= ~a12~0 73282) .cse7 (= 8 ~a15~0)) (not (= 7 |old(~a21~0)|)) (and .cse8 (and .cse9 .cse5)) (and .cse10 .cse11) (not (= 0 (+ |old(~a12~0)| 49))) (and .cse12 .cse1 .cse8 .cse3) (and (not (= 10 ~a21~0)) (and .cse13 .cse6) (not .cse4)) (and .cse2 .cse1 .cse8 .cse3) (and .cse14 .cse8) (and .cse1 .cse15 .cse2) (and .cse9 .cse11) (and .cse0 .cse14) (and (< 18 ~a12~0) .cse6 (<= ~a12~0 72) (and .cse2 .cse3)) (= 6 ~a15~0) (and .cse16 .cse1 .cse15) (and (= 7 ~a21~0) (and .cse0 .cse1 .cse3)) (and .cse10 .cse1 (< 80 ~a12~0) .cse3) (not (= 1 |old(~a24~0)|)) (and .cse4 .cse7 (= ~a15~0 |old(~a15~0)|)))))) [2018-12-09 01:44:33,801 INFO L448 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2018-12-09 01:44:33,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:44:33 BoogieIcfgContainer [2018-12-09 01:44:33,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:44:33,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:44:33,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:44:33,810 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:44:33,810 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:23" (3/4) ... [2018-12-09 01:44:33,812 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 01:44:33,816 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 01:44:33,816 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-09 01:44:33,816 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 01:44:33,824 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 01:44:33,824 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 01:44:33,842 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((81 <= a12 && 1 == a24) && a21 == 8) && 9 == a15) || !(8 == \old(a15))) || ((((6 == a21 && a12 <= 95434) && 1 == a24) && 9 == a15) && 95380 < a12)) || (5 == a15 && a24 == \old(a24))) || ((a12 <= 73282 && (((81 <= a12 && a21 <= 8) && \old(a12) <= 11) && a24 == \old(a24)) && !(a21 == 0) && a24 == 1) && 8 == a15)) || !(7 == \old(a21))) || (a12 <= 11 && a21 == 6 && 5 == a15)) || (9 <= a21 && (1 == a24 && a15 <= 7) && (!(6 == \old(a21)) || !(5 == \old(a15))))) || !(0 == \old(a12) + 49)) || (((10 <= a21 && 1 == a24) && a12 <= 11) && 9 == a15)) || ((!(10 == a21) && ((a12 <= 80 && !(a21 == 0)) && a15 == 8) && a24 == \old(a24)) && !(6 == a21))) || (((a21 == 8 && 1 == a24) && a12 <= 11) && 9 == a15)) || (((a15 <= \old(a15) && (a15 == 8 && a24 == 1) && a21 == 10) || (((((a12 <= 80 && !(a21 == 0)) && a15 == 8) && 10 <= a21) && a15 <= \old(a15)) && a24 == \old(a24))) && a12 <= 11)) || ((1 == a24 && a15 <= 7) && a21 == 8)) || (a21 == 6 && (1 == a24 && a15 <= 7) && (!(6 == \old(a21)) || !(5 == \old(a15))))) || (81 <= a12 && ((a15 <= \old(a15) && (a15 == 8 && a24 == 1) && a21 == 10) || (((((a12 <= 80 && !(a21 == 0)) && a15 == 8) && 10 <= a21) && a15 <= \old(a15)) && a24 == \old(a24))))) || (((18 < a12 && a24 == \old(a24)) && a12 <= 72) && a21 == 8 && 9 == a15)) || 6 == a15) || ((a12 <= 80 && 1 == a24) && a15 <= 7)) || (7 == a21 && (81 <= a12 && 1 == a24) && 9 == a15)) || (((9 <= a21 && 1 == a24) && 80 < a12) && 9 == a15)) || !(1 == \old(a24))) || ((6 == a21 && (((81 <= a12 && a21 <= 8) && \old(a12) <= 11) && a24 == \old(a24)) && !(a21 == 0) && a24 == 1) && a15 == \old(a15)) [2018-12-09 01:44:33,889 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3ef77ada-df70-4655-8e48-a96e90e9bcc4/bin-2019/utaipan/witness.graphml [2018-12-09 01:44:33,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:44:33,890 INFO L168 Benchmark]: Toolchain (without parser) took 191270.63 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 950.6 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-09 01:44:33,891 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:44:33,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:44:33,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:44:33,891 INFO L168 Benchmark]: Boogie Preprocessor took 58.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:44:33,891 INFO L168 Benchmark]: RCFGBuilder took 738.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 947.5 MB in the end (delta: 124.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:44:33,891 INFO L168 Benchmark]: TraceAbstraction took 189996.11 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 947.5 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-09 01:44:33,892 INFO L168 Benchmark]: Witness Printer took 80.22 ms. Allocated memory is still 3.9 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 7.5 kB). Peak memory consumption was 7.5 kB. Max. memory is 11.5 GB. [2018-12-09 01:44:33,893 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 738.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 947.5 MB in the end (delta: 124.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 189996.11 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 947.5 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 80.22 ms. Allocated memory is still 3.9 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 7.5 kB). Peak memory consumption was 7.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((81 <= a12 && 1 == a24) && a21 == 8) && 9 == a15) || !(8 == \old(a15))) || ((((6 == a21 && a12 <= 95434) && 1 == a24) && 9 == a15) && 95380 < a12)) || (5 == a15 && a24 == \old(a24))) || ((a12 <= 73282 && (((81 <= a12 && a21 <= 8) && \old(a12) <= 11) && a24 == \old(a24)) && !(a21 == 0) && a24 == 1) && 8 == a15)) || !(7 == \old(a21))) || (a12 <= 11 && a21 == 6 && 5 == a15)) || (9 <= a21 && (1 == a24 && a15 <= 7) && (!(6 == \old(a21)) || !(5 == \old(a15))))) || !(0 == \old(a12) + 49)) || (((10 <= a21 && 1 == a24) && a12 <= 11) && 9 == a15)) || ((!(10 == a21) && ((a12 <= 80 && !(a21 == 0)) && a15 == 8) && a24 == \old(a24)) && !(6 == a21))) || (((a21 == 8 && 1 == a24) && a12 <= 11) && 9 == a15)) || (((a15 <= \old(a15) && (a15 == 8 && a24 == 1) && a21 == 10) || (((((a12 <= 80 && !(a21 == 0)) && a15 == 8) && 10 <= a21) && a15 <= \old(a15)) && a24 == \old(a24))) && a12 <= 11)) || ((1 == a24 && a15 <= 7) && a21 == 8)) || (a21 == 6 && (1 == a24 && a15 <= 7) && (!(6 == \old(a21)) || !(5 == \old(a15))))) || (81 <= a12 && ((a15 <= \old(a15) && (a15 == 8 && a24 == 1) && a21 == 10) || (((((a12 <= 80 && !(a21 == 0)) && a15 == 8) && 10 <= a21) && a15 <= \old(a15)) && a24 == \old(a24))))) || (((18 < a12 && a24 == \old(a24)) && a12 <= 72) && a21 == 8 && 9 == a15)) || 6 == a15) || ((a12 <= 80 && 1 == a24) && a15 <= 7)) || (7 == a21 && (81 <= a12 && 1 == a24) && 9 == a15)) || (((9 <= a21 && 1 == a24) && 80 < a12) && 9 == a15)) || !(1 == \old(a24))) || ((6 == a21 && (((81 <= a12 && a21 <= 8) && \old(a12) <= 11) && a24 == \old(a24)) && !(a21 == 0) && a24 == 1) && a15 == \old(a15)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 189.9s OverallTime, 17 OverallIterations, 14 TraceHistogramMax, 112.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1208 SDtfs, 31672 SDslu, 1997 SDs, 0 SdLazy, 38641 SolverSat, 5119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 20223 GetRequests, 19775 SyntacticMatches, 20 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5680 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6090occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 52.1s AbstIntTime, 15 AbstIntIterations, 4 AbstIntStrong, 0.9973783193390653 AbsIntWeakeningRatio, 0.08846990572878898 AbsIntAvgWeakeningVarsNumRemoved, 16.210297316896302 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 3425 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 442 PreInvPairs, 616 NumberOfFragments, 1542 HoareAnnotationTreeSize, 442 FomulaSimplifications, 160805 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 54965 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 19951 NumberOfCodeBlocks, 19951 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 29077 ConstructedInterpolants, 0 QuantifiedInterpolants, 90245326 SizeOfPredicates, 21 NumberOfNonLiveVariables, 13085 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 39 InterpolantComputations, 4 PerfectInterpolantSequences, 74336/84196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...