./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label11_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_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/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 e09138f51265758a55ca4b42a17e715ba685a263 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 00:22:22,984 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 00:22:22,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 00:22:22,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 00:22:22,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 00:22:22,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 00:22:22,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 00:22:22,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 00:22:22,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 00:22:22,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 00:22:22,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 00:22:22,994 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 00:22:22,994 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 00:22:22,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 00:22:22,995 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 00:22:22,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 00:22:22,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 00:22:22,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 00:22:22,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 00:22:22,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 00:22:22,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 00:22:22,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 00:22:23,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 00:22:23,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 00:22:23,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 00:22:23,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 00:22:23,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 00:22:23,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 00:22:23,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 00:22:23,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 00:22:23,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 00:22:23,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 00:22:23,003 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 00:22:23,003 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 00:22:23,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 00:22:23,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 00:22:23,004 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 00:22:23,011 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 00:22:23,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 00:22:23,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 00:22:23,012 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 00:22:23,012 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 00:22:23,012 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 00:22:23,012 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 00:22:23,012 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 00:22:23,012 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 00:22:23,012 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 00:22:23,012 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 00:22:23,012 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 00:22:23,013 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 00:22:23,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 00:22:23,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 00:22:23,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 00:22:23,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 00:22:23,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 00:22:23,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 00:22:23,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 00:22:23,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 00:22:23,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 00:22:23,014 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 00:22:23,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 00:22:23,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 00:22:23,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 00:22:23,014 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 00:22:23,014 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 00:22:23,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 00:22:23,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 00:22:23,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 00:22:23,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 00:22:23,015 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 00:22:23,015 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 00:22:23,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 00:22:23,015 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 00:22:23,015 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_680fcba1-2b1c-426f-a16e-fa3a44f93e45/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 -> e09138f51265758a55ca4b42a17e715ba685a263 [2018-12-03 00:22:23,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 00:22:23,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 00:22:23,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 00:22:23,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 00:22:23,045 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 00:22:23,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-12-03 00:22:23,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/data/43eea5f83/7e2284fdbff7497dad18d534e7a6baf9/FLAG27752d62e [2018-12-03 00:22:23,512 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 00:22:23,513 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-12-03 00:22:23,520 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/data/43eea5f83/7e2284fdbff7497dad18d534e7a6baf9/FLAG27752d62e [2018-12-03 00:22:23,529 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/data/43eea5f83/7e2284fdbff7497dad18d534e7a6baf9 [2018-12-03 00:22:23,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 00:22:23,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 00:22:23,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 00:22:23,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 00:22:23,534 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 00:22:23,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23, skipping insertion in model container [2018-12-03 00:22:23,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 00:22:23,567 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 00:22:23,743 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:22:23,747 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 00:22:23,837 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:22:23,846 INFO L195 MainTranslator]: Completed translation [2018-12-03 00:22:23,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23 WrapperNode [2018-12-03 00:22:23,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 00:22:23,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 00:22:23,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 00:22:23,847 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 00:22:23,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 00:22:23,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 00:22:23,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 00:22:23,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 00:22:23,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... [2018-12-03 00:22:23,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 00:22:23,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 00:22:23,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 00:22:23,904 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 00:22:23,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/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-03 00:22:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 00:22:23,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 00:22:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-03 00:22:23,936 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-03 00:22:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 00:22:23,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 00:22:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 00:22:23,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 00:22:24,440 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 00:22:24,440 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 00:22:24,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:22:24 BoogieIcfgContainer [2018-12-03 00:22:24,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 00:22:24,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 00:22:24,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 00:22:24,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 00:22:24,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:22:23" (1/3) ... [2018-12-03 00:22:24,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d43cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:22:24, skipping insertion in model container [2018-12-03 00:22:24,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:22:23" (2/3) ... [2018-12-03 00:22:24,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d43cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:22:24, skipping insertion in model container [2018-12-03 00:22:24,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:22:24" (3/3) ... [2018-12-03 00:22:24,446 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-12-03 00:22:24,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 00:22:24,460 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 00:22:24,473 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 00:22:24,500 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 00:22:24,500 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 00:22:24,500 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 00:22:24,500 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 00:22:24,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 00:22:24,501 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 00:22:24,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 00:22:24,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 00:22:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-03 00:22:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 00:22:24,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:24,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:24,529 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:24,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:24,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1377016033, now seen corresponding path program 1 times [2018-12-03 00:22:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:24,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:24,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:24,777 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-03 00:22:24,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:22:24,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:22:24,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:24,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:22:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:22:24,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:22:24,792 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-12-03 00:22:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:25,210 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-12-03 00:22:25,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:22:25,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-03 00:22:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:25,220 INFO L225 Difference]: With dead ends: 547 [2018-12-03 00:22:25,220 INFO L226 Difference]: Without dead ends: 278 [2018-12-03 00:22:25,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:22:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-03 00:22:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-03 00:22:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-03 00:22:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 400 transitions. [2018-12-03 00:22:25,259 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 400 transitions. Word has length 115 [2018-12-03 00:22:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:25,260 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 400 transitions. [2018-12-03 00:22:25,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:22:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 400 transitions. [2018-12-03 00:22:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 00:22:25,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:25,264 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:25,264 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:25,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1300380632, now seen corresponding path program 1 times [2018-12-03 00:22:25,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:25,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:25,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:22:25,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:22:25,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:22:25,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:25,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:22:25,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:22:25,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:22:25,351 INFO L87 Difference]: Start difference. First operand 278 states and 400 transitions. Second operand 6 states. [2018-12-03 00:22:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:25,758 INFO L93 Difference]: Finished difference Result 703 states and 1026 transitions. [2018-12-03 00:22:25,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:22:25,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-03 00:22:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:25,761 INFO L225 Difference]: With dead ends: 703 [2018-12-03 00:22:25,762 INFO L226 Difference]: Without dead ends: 431 [2018-12-03 00:22:25,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 00:22:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-03 00:22:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 419. [2018-12-03 00:22:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 00:22:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2018-12-03 00:22:25,778 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 125 [2018-12-03 00:22:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:25,778 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2018-12-03 00:22:25,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:22:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2018-12-03 00:22:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 00:22:25,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:25,780 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:25,780 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:25,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash 860697510, now seen corresponding path program 1 times [2018-12-03 00:22:25,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:25,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:25,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:22:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:22:25,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:22:25,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:22:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:22:25,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:22:25,945 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 5 states. [2018-12-03 00:22:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:26,264 INFO L93 Difference]: Finished difference Result 933 states and 1337 transitions. [2018-12-03 00:22:26,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:22:26,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-12-03 00:22:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:26,266 INFO L225 Difference]: With dead ends: 933 [2018-12-03 00:22:26,266 INFO L226 Difference]: Without dead ends: 417 [2018-12-03 00:22:26,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:22:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-03 00:22:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-03 00:22:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-03 00:22:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 550 transitions. [2018-12-03 00:22:26,277 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 550 transitions. Word has length 126 [2018-12-03 00:22:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:26,277 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 550 transitions. [2018-12-03 00:22:26,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:22:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 550 transitions. [2018-12-03 00:22:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 00:22:26,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:26,279 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:26,279 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:26,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1706034196, now seen corresponding path program 1 times [2018-12-03 00:22:26,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:26,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:26,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:26,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:26,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:22:26,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:22:26,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:22:26,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:26,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:22:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:22:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:22:26,451 INFO L87 Difference]: Start difference. First operand 417 states and 550 transitions. Second operand 5 states. [2018-12-03 00:22:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:26,768 INFO L93 Difference]: Finished difference Result 912 states and 1228 transitions. [2018-12-03 00:22:26,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:22:26,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-03 00:22:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:26,770 INFO L225 Difference]: With dead ends: 912 [2018-12-03 00:22:26,770 INFO L226 Difference]: Without dead ends: 417 [2018-12-03 00:22:26,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:22:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-03 00:22:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-03 00:22:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-03 00:22:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-12-03 00:22:26,778 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 127 [2018-12-03 00:22:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:26,778 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-12-03 00:22:26,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:22:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-12-03 00:22:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 00:22:26,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:26,780 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:26,780 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:26,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 508544498, now seen corresponding path program 1 times [2018-12-03 00:22:26,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:26,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:26,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:22:26,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:22:26,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:22:26,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:26,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:22:26,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:22:26,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:22:26,855 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 3 states. [2018-12-03 00:22:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:27,106 INFO L93 Difference]: Finished difference Result 1237 states and 1661 transitions. [2018-12-03 00:22:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:22:27,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-12-03 00:22:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:27,109 INFO L225 Difference]: With dead ends: 1237 [2018-12-03 00:22:27,109 INFO L226 Difference]: Without dead ends: 826 [2018-12-03 00:22:27,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:22:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-12-03 00:22:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2018-12-03 00:22:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2018-12-03 00:22:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1069 transitions. [2018-12-03 00:22:27,131 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1069 transitions. Word has length 132 [2018-12-03 00:22:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:27,132 INFO L480 AbstractCegarLoop]: Abstraction has 826 states and 1069 transitions. [2018-12-03 00:22:27,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:22:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1069 transitions. [2018-12-03 00:22:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 00:22:27,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:27,134 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:27,134 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:27,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:27,135 INFO L82 PathProgramCache]: Analyzing trace with hash -486972616, now seen corresponding path program 1 times [2018-12-03 00:22:27,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:27,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:27,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:27,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:27,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:22:27,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:22:27,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:22:27,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:27,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:22:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:22:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:22:27,191 INFO L87 Difference]: Start difference. First operand 826 states and 1069 transitions. Second operand 6 states. [2018-12-03 00:22:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:27,562 INFO L93 Difference]: Finished difference Result 2375 states and 3230 transitions. [2018-12-03 00:22:27,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:22:27,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-12-03 00:22:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:27,567 INFO L225 Difference]: With dead ends: 2375 [2018-12-03 00:22:27,567 INFO L226 Difference]: Without dead ends: 1555 [2018-12-03 00:22:27,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 00:22:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-12-03 00:22:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1531. [2018-12-03 00:22:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2018-12-03 00:22:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1927 transitions. [2018-12-03 00:22:27,597 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1927 transitions. Word has length 133 [2018-12-03 00:22:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:27,597 INFO L480 AbstractCegarLoop]: Abstraction has 1531 states and 1927 transitions. [2018-12-03 00:22:27,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:22:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1927 transitions. [2018-12-03 00:22:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 00:22:27,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:27,600 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:27,600 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:27,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:27,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1684411513, now seen corresponding path program 1 times [2018-12-03 00:22:27,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:27,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:27,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:27,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:27,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:22:27,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:27,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:22:27,660 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-12-03 00:22:27,661 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-03 00:22:27,687 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:22:27,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:22:27,937 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 00:22:27,938 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Performed 1543 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1543 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-03 00:22:27,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:27,955 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 00:22:28,190 INFO L227 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 80.41% of their original sizes. [2018-12-03 00:22:28,190 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 00:22:28,203 INFO L418 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-12-03 00:22:28,203 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 00:22:28,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:22:28,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-03 00:22:28,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:28,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:22:28,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:22:28,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:22:28,205 INFO L87 Difference]: Start difference. First operand 1531 states and 1927 transitions. Second operand 6 states. [2018-12-03 00:22:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:29,993 INFO L93 Difference]: Finished difference Result 3192 states and 4016 transitions. [2018-12-03 00:22:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:22:29,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-12-03 00:22:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:29,999 INFO L225 Difference]: With dead ends: 3192 [2018-12-03 00:22:29,999 INFO L226 Difference]: Without dead ends: 1667 [2018-12-03 00:22:30,001 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 143 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-03 00:22:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-03 00:22:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1666. [2018-12-03 00:22:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2018-12-03 00:22:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2068 transitions. [2018-12-03 00:22:30,042 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2068 transitions. Word has length 148 [2018-12-03 00:22:30,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:30,042 INFO L480 AbstractCegarLoop]: Abstraction has 1666 states and 2068 transitions. [2018-12-03 00:22:30,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:22:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2068 transitions. [2018-12-03 00:22:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 00:22:30,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:30,046 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:30,047 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:30,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1310973214, now seen corresponding path program 1 times [2018-12-03 00:22:30,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:30,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:30,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 00:22:30,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:30,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:22:30,127 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-12-03 00:22:30,127 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-03 00:22:30,130 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:22:30,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:22:30,302 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 00:22:30,302 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 4 different actions 4 times. Never widened. Performed 3083 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3083 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-03 00:22:30,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:30,307 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 00:22:30,462 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 81.82% of their original sizes. [2018-12-03 00:22:30,462 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 00:22:30,506 INFO L418 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2018-12-03 00:22:30,507 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 00:22:30,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:22:30,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-03 00:22:30,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:30,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 00:22:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 00:22:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:22:30,508 INFO L87 Difference]: Start difference. First operand 1666 states and 2068 transitions. Second operand 10 states. [2018-12-03 00:22:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:32,637 INFO L93 Difference]: Finished difference Result 3330 states and 4160 transitions. [2018-12-03 00:22:32,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 00:22:32,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2018-12-03 00:22:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:32,641 INFO L225 Difference]: With dead ends: 3330 [2018-12-03 00:22:32,641 INFO L226 Difference]: Without dead ends: 1805 [2018-12-03 00:22:32,642 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 147 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-03 00:22:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-12-03 00:22:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1803. [2018-12-03 00:22:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2018-12-03 00:22:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2215 transitions. [2018-12-03 00:22:32,669 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2215 transitions. Word has length 156 [2018-12-03 00:22:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:32,669 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2215 transitions. [2018-12-03 00:22:32,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 00:22:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2215 transitions. [2018-12-03 00:22:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 00:22:32,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:32,672 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:32,672 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:32,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash -421933084, now seen corresponding path program 1 times [2018-12-03 00:22:32,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:32,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:32,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 82 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 00:22:32,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:32,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:22:32,738 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-03 00:22:32,738 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-03 00:22:32,740 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:22:32,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:22:32,853 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 00:22:32,853 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 4 different actions 4 times. Never widened. Performed 3143 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3143 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-03 00:22:32,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:32,854 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 00:22:32,993 INFO L227 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 81.78% of their original sizes. [2018-12-03 00:22:32,993 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 00:22:33,045 INFO L418 sIntCurrentIteration]: We unified 188 AI predicates to 188 [2018-12-03 00:22:33,045 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 00:22:33,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:22:33,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-03 00:22:33,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:33,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 00:22:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 00:22:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:22:33,046 INFO L87 Difference]: Start difference. First operand 1803 states and 2215 transitions. Second operand 10 states. [2018-12-03 00:22:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:35,165 INFO L93 Difference]: Finished difference Result 3741 states and 4627 transitions. [2018-12-03 00:22:35,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 00:22:35,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-12-03 00:22:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:35,170 INFO L225 Difference]: With dead ends: 3741 [2018-12-03 00:22:35,170 INFO L226 Difference]: Without dead ends: 2216 [2018-12-03 00:22:35,172 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 180 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-03 00:22:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2018-12-03 00:22:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2214. [2018-12-03 00:22:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2018-12-03 00:22:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2648 transitions. [2018-12-03 00:22:35,204 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2648 transitions. Word has length 189 [2018-12-03 00:22:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:35,204 INFO L480 AbstractCegarLoop]: Abstraction has 2214 states and 2648 transitions. [2018-12-03 00:22:35,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 00:22:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2648 transitions. [2018-12-03 00:22:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 00:22:35,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:35,208 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:35,208 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:35,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1573168407, now seen corresponding path program 1 times [2018-12-03 00:22:35,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:35,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:35,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:35,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 79 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 00:22:35,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:35,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:22:35,319 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-12-03 00:22:35,319 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-03 00:22:35,322 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:22:35,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:22:35,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:22:35,590 INFO L272 AbstractInterpreter]: Visited 122 different actions 483 times. Merged at 8 different actions 28 times. Never widened. Performed 6832 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-03 00:22:35,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:35,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:22:35,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:35,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/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-03 00:22:35,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:35,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:22:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:35,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:22:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-03 00:22:35,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:22:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 84 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 00:22:35,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:22:35,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-03 00:22:35,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:22:35,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 00:22:35,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 00:22:35,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-03 00:22:35,820 INFO L87 Difference]: Start difference. First operand 2214 states and 2648 transitions. Second operand 11 states. [2018-12-03 00:22:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:36,808 INFO L93 Difference]: Finished difference Result 6527 states and 8187 transitions. [2018-12-03 00:22:36,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 00:22:36,808 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2018-12-03 00:22:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:36,816 INFO L225 Difference]: With dead ends: 6527 [2018-12-03 00:22:36,816 INFO L226 Difference]: Without dead ends: 4865 [2018-12-03 00:22:36,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 397 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-12-03 00:22:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2018-12-03 00:22:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4859. [2018-12-03 00:22:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4859 states. [2018-12-03 00:22:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4859 states to 4859 states and 5874 transitions. [2018-12-03 00:22:36,896 INFO L78 Accepts]: Start accepts. Automaton has 4859 states and 5874 transitions. Word has length 197 [2018-12-03 00:22:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:36,897 INFO L480 AbstractCegarLoop]: Abstraction has 4859 states and 5874 transitions. [2018-12-03 00:22:36,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 00:22:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4859 states and 5874 transitions. [2018-12-03 00:22:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 00:22:36,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:36,904 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:22:36,904 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:36,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash 924757225, now seen corresponding path program 1 times [2018-12-03 00:22:36,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:36,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:36,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 00:22:37,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:37,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:22:37,014 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-12-03 00:22:37,014 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-03 00:22:37,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:22:37,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:22:37,166 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 00:22:37,166 INFO L272 AbstractInterpreter]: Visited 121 different actions 355 times. Merged at 6 different actions 12 times. Never widened. Performed 4710 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4710 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-03 00:22:37,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:37,170 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 00:22:37,343 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 83.4% of their original sizes. [2018-12-03 00:22:37,343 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 00:22:37,395 INFO L418 sIntCurrentIteration]: We unified 205 AI predicates to 205 [2018-12-03 00:22:37,395 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 00:22:37,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:22:37,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-03 00:22:37,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:22:37,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 00:22:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 00:22:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:22:37,396 INFO L87 Difference]: Start difference. First operand 4859 states and 5874 transitions. Second operand 10 states. [2018-12-03 00:22:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:38,879 INFO L93 Difference]: Finished difference Result 9716 states and 11842 transitions. [2018-12-03 00:22:38,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 00:22:38,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-12-03 00:22:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:38,887 INFO L225 Difference]: With dead ends: 9716 [2018-12-03 00:22:38,888 INFO L226 Difference]: Without dead ends: 5546 [2018-12-03 00:22:38,892 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 197 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-03 00:22:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2018-12-03 00:22:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 5542. [2018-12-03 00:22:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2018-12-03 00:22:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 6640 transitions. [2018-12-03 00:22:38,959 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 6640 transitions. Word has length 206 [2018-12-03 00:22:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:38,960 INFO L480 AbstractCegarLoop]: Abstraction has 5542 states and 6640 transitions. [2018-12-03 00:22:38,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 00:22:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 6640 transitions. [2018-12-03 00:22:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 00:22:38,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:38,966 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:38,966 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:38,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1274612791, now seen corresponding path program 1 times [2018-12-03 00:22:38,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:38,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-03 00:22:39,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:39,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:22:39,057 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-03 00:22:39,057 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-03 00:22:39,059 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:22:39,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:22:39,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:22:39,294 INFO L272 AbstractInterpreter]: Visited 122 different actions 483 times. Merged at 8 different actions 28 times. Never widened. Performed 6983 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6983 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-03 00:22:39,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:39,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:22:39,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:39,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/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-03 00:22:39,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:39,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:22:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:39,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:22:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 134 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-03 00:22:39,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:22:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 146 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-03 00:22:39,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:22:39,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-12-03 00:22:39,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:22:39,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:22:39,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:22:39,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 00:22:39,468 INFO L87 Difference]: Start difference. First operand 5542 states and 6640 transitions. Second operand 8 states. [2018-12-03 00:22:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:40,302 INFO L93 Difference]: Finished difference Result 10656 states and 13230 transitions. [2018-12-03 00:22:40,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 00:22:40,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 222 [2018-12-03 00:22:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:40,321 INFO L225 Difference]: With dead ends: 10656 [2018-12-03 00:22:40,321 INFO L226 Difference]: Without dead ends: 6486 [2018-12-03 00:22:40,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 453 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-12-03 00:22:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2018-12-03 00:22:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5741. [2018-12-03 00:22:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5741 states. [2018-12-03 00:22:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 6750 transitions. [2018-12-03 00:22:40,408 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 6750 transitions. Word has length 222 [2018-12-03 00:22:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:40,409 INFO L480 AbstractCegarLoop]: Abstraction has 5741 states and 6750 transitions. [2018-12-03 00:22:40,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:22:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 6750 transitions. [2018-12-03 00:22:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-12-03 00:22:40,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:40,415 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:40,416 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:40,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1436750508, now seen corresponding path program 1 times [2018-12-03 00:22:40,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:40,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:40,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:40,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:40,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 178 proven. 69 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-03 00:22:40,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:40,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:22:40,517 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-12-03 00:22:40,518 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-03 00:22:40,519 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:22:40,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:22:40,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:22:40,750 INFO L272 AbstractInterpreter]: Visited 123 different actions 488 times. Merged at 9 different actions 29 times. Widened at 1 different actions 1 times. Performed 7015 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7015 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-03 00:22:40,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:40,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:22:40,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:40,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/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-03 00:22:40,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:40,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:22:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:40,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:22:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 188 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 00:22:40,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:22:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 188 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 00:22:40,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:22:40,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2018-12-03 00:22:40,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:22:40,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 00:22:40,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 00:22:40,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 00:22:40,933 INFO L87 Difference]: Start difference. First operand 5741 states and 6750 transitions. Second operand 12 states. [2018-12-03 00:22:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:42,583 INFO L93 Difference]: Finished difference Result 11379 states and 14550 transitions. [2018-12-03 00:22:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 00:22:42,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2018-12-03 00:22:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:42,604 INFO L225 Difference]: With dead ends: 11379 [2018-12-03 00:22:42,604 INFO L226 Difference]: Without dead ends: 6603 [2018-12-03 00:22:42,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=425, Invalid=1831, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 00:22:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2018-12-03 00:22:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 5465. [2018-12-03 00:22:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2018-12-03 00:22:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 6307 transitions. [2018-12-03 00:22:42,699 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 6307 transitions. Word has length 242 [2018-12-03 00:22:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:42,699 INFO L480 AbstractCegarLoop]: Abstraction has 5465 states and 6307 transitions. [2018-12-03 00:22:42,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 00:22:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 6307 transitions. [2018-12-03 00:22:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-03 00:22:42,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:22:42,704 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:22:42,704 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:22:42,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2001996586, now seen corresponding path program 1 times [2018-12-03 00:22:42,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:22:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:42,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:22:42,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:22:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 148 proven. 103 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 00:22:43,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:43,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:22:43,032 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-12-03 00:22:43,032 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-03 00:22:43,034 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:22:43,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:22:43,305 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:22:43,305 INFO L272 AbstractInterpreter]: Visited 123 different actions 608 times. Merged at 8 different actions 37 times. Never widened. Performed 8472 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8472 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-03 00:22:43,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:22:43,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:22:43,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:22:43,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/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-03 00:22:43,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:22:43,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:22:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:22:43,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:22:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-03 00:22:43,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:22:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-03 00:22:43,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:22:43,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-12-03 00:22:43,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:22:43,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 00:22:43,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 00:22:43,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-03 00:22:43,517 INFO L87 Difference]: Start difference. First operand 5465 states and 6307 transitions. Second operand 17 states. [2018-12-03 00:22:44,181 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-12-03 00:22:44,457 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2018-12-03 00:22:44,702 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2018-12-03 00:22:44,902 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-12-03 00:22:45,105 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-03 00:22:46,327 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2018-12-03 00:22:46,537 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-12-03 00:22:47,494 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-12-03 00:22:49,011 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2018-12-03 00:22:49,336 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 00:22:49,720 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2018-12-03 00:22:50,129 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-12-03 00:22:51,113 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-12-03 00:22:51,523 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-12-03 00:22:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:22:52,291 INFO L93 Difference]: Finished difference Result 10420 states and 12102 transitions. [2018-12-03 00:22:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 00:22:52,291 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 244 [2018-12-03 00:22:52,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:22:52,292 INFO L225 Difference]: With dead ends: 10420 [2018-12-03 00:22:52,292 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 00:22:52,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1090, Invalid=4610, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 00:22:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 00:22:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 00:22:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 00:22:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 00:22:52,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2018-12-03 00:22:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:22:52,302 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:22:52,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 00:22:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 00:22:52,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 00:22:52,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 00:22:52,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,702 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 272 [2018-12-03 00:22:52,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:22:52,927 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 281 [2018-12-03 00:22:54,146 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 256 DAG size of output: 92 [2018-12-03 00:22:54,809 WARN L180 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 72 [2018-12-03 00:22:55,504 WARN L180 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 72 [2018-12-03 00:22:55,506 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 00:22:55,506 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (= ~a8~0 |old(~a8~0)|) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-12-03 00:22:55,506 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,507 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,508 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-03 00:22:55,509 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-03 00:22:55,510 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,511 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,512 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-03 00:22:55,513 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse7 (= 4 |old(~a16~0)|)) (.cse23 (= ~a21~0 |old(~a21~0)|)) (.cse10 (= 1 |old(~a17~0)|)) (.cse24 (= 1 |old(~a20~0)|)) (.cse14 (= ~a17~0 |old(~a17~0)|)) (.cse15 (= |old(~a7~0)| ~a7~0)) (.cse16 (= ~a16~0 |old(~a16~0)|)) (.cse22 (= ~a8~0 |old(~a8~0)|)) (.cse19 (= 1 ~a21~0)) (.cse17 (= ~a20~0 |old(~a20~0)|))) (let ((.cse9 (< |old(~a8~0)| 14)) (.cse2 (not (= 15 |old(~a8~0)|))) (.cse3 (and .cse14 .cse15 .cse16 .cse22 .cse19 .cse17)) (.cse6 (= 6 |old(~a16~0)|)) (.cse5 (< 0 |old(~a20~0)|)) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse11 (not .cse24)) (.cse18 (= 13 ~a8~0)) (.cse20 (not (= 13 |old(~a8~0)|))) (.cse21 (not .cse10)) (.cse8 (and .cse23 .cse14 .cse15 .cse16 .cse22 .cse17)) (.cse12 (< 0 |old(~a21~0)|)) (.cse1 (= 1 |old(~a7~0)|)) (.cse13 (not .cse7)) (.cse4 (not (= 8 ~a12~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse4 .cse10) (or (or .cse6 .cse11 .cse12) .cse8 .cse4) (or .cse1 .cse11 .cse13 .cse4 (and .cse14 (<= ~a21~0 |old(~a21~0)|) .cse15 .cse16 (<= |old(~a8~0)| ~a8~0) .cse17)) (or .cse0 .cse1 .cse11 .cse13 .cse4 (and .cse18 .cse19) .cse20) (or .cse6 .cse9 .cse8 .cse4 .cse10 .cse5) (or .cse6 .cse0 .cse1 .cse7 .cse2 .cse4 .cse3) (or .cse1 .cse7 .cse11 .cse8 .cse4 .cse21) (or (not .cse6) .cse0 .cse1 .cse2 .cse3 (not (= |old(~a20~0)| 1)) .cse4) (or (and .cse22 (and .cse14 .cse15 .cse16 .cse17) .cse23) (or .cse1 .cse13 .cse4 .cse10)) (or .cse6 .cse8 .cse4 .cse12 .cse5) (or .cse0 .cse11 .cse13 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse18 (= |old(~a16~0)| ~a16~0) .cse19 (= 1 ~a17~0)) .cse4 (not .cse1) .cse20 .cse21) (or .cse7 .cse8 .cse4 (< |old(~a20~0)| 1) .cse10 .cse12) (or (or .cse1 .cse13 .cse4 .cse24 (< |old(~a8~0)| 15)) (and (and .cse14 .cse15 .cse16) .cse22 .cse17 .cse23))))) [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-03 00:22:55,514 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-03 00:22:55,515 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-03 00:22:55,516 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= 15 ~a8~0) (= 1 ~a17~0) (= ~a16~0 5)) [2018-12-03 00:22:55,517 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (and (= 1 ~a21~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (= ~a8~0 |old(~a8~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|))) [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse7 (<= 14 ~a8~0)) (.cse3 (not (= ~a16~0 6))) (.cse10 (= 1 ~a20~0)) (.cse11 (= 1 ~a17~0)) (.cse8 (<= ~a20~0 0)) (.cse9 (<= ~a21~0 0)) (.cse2 (not (= ~a17~0 1))) (.cse6 (not .cse1)) (.cse0 (not (= ~a7~0 1))) (.cse12 (= |old(~a20~0)| ~a20~0)) (.cse4 (= 1 ~a21~0)) (.cse5 (= 15 ~a8~0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and (and .cse0 .cse3) .cse4 .cse5) (and (and .cse3 .cse2 .cse6) .cse7) (and .cse0 (<= 15 ~a8~0) .cse1) (and .cse7 .cse3 .cse2 .cse8) (and .cse9 .cse3 .cse8) (and .cse9 .cse10 .cse3) (and .cse10 (= 13 ~a8~0) (= 4 ~a16~0) .cse4 .cse11) (and .cse0 .cse12 .cse11) (and .cse4 (and .cse0 .cse8) .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse9 .cse2 .cse6 (<= 1 ~a20~0)) (and .cse0 .cse12 .cse4 .cse5)))) [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-03 00:22:55,517 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse7 (<= 14 ~a8~0)) (.cse3 (not (= ~a16~0 6))) (.cse10 (= 1 ~a20~0)) (.cse11 (= 1 ~a17~0)) (.cse8 (<= ~a20~0 0)) (.cse9 (<= ~a21~0 0)) (.cse2 (not (= ~a17~0 1))) (.cse6 (not .cse1)) (.cse0 (not (= ~a7~0 1))) (.cse12 (= |old(~a20~0)| ~a20~0)) (.cse4 (= 1 ~a21~0)) (.cse5 (= 15 ~a8~0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and (and .cse0 .cse3) .cse4 .cse5) (and (and .cse3 .cse2 .cse6) .cse7) (and .cse0 (<= 15 ~a8~0) .cse1) (and .cse7 .cse3 .cse2 .cse8) (and .cse9 .cse3 .cse8) (and .cse9 .cse10 .cse3) (and .cse10 (= 13 ~a8~0) (= 4 ~a16~0) .cse4 .cse11) (and .cse0 .cse12 .cse11) (and .cse4 (and .cse0 .cse8) .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse9 .cse2 .cse6 (<= 1 ~a20~0)) (and .cse0 .cse12 .cse4 .cse5)))) [2018-12-03 00:22:55,517 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-12-03 00:22:55,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:22:55 BoogieIcfgContainer [2018-12-03 00:22:55,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 00:22:55,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 00:22:55,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 00:22:55,526 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 00:22:55,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:22:24" (3/4) ... [2018-12-03 00:22:55,529 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 00:22:55,534 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 00:22:55,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-03 00:22:55,535 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 00:22:55,544 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-03 00:22:55,544 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 00:22:55,569 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(1 == \old(a21)) || ((!(a7 == 1) && a16 == 4) && !(a17 == 1))) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || (((!(a7 == 1) && !(a16 == 6)) && 1 == a21) && 15 == a8)) || (((!(a16 == 6) && !(a17 == 1)) && !(a16 == 4)) && 14 <= a8)) || ((!(a7 == 1) && 15 <= a8) && a16 == 4)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && 1 == a17)) || ((1 == a21 && !(a7 == 1) && a20 <= 0) && 15 == a8)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || (((a21 <= 0 && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20)) || (((!(a7 == 1) && \old(a20) == a20) && 1 == a21) && 15 == a8) [2018-12-03 00:22:55,620 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_680fcba1-2b1c-426f-a16e-fa3a44f93e45/bin-2019/utaipan/witness.graphml [2018-12-03 00:22:55,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 00:22:55,621 INFO L168 Benchmark]: Toolchain (without parser) took 32090.28 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-03 00:22:55,622 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:22:55,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2018-12-03 00:22:55,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-03 00:22:55,622 INFO L168 Benchmark]: Boogie Preprocessor took 37.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-03 00:22:55,622 INFO L168 Benchmark]: RCFGBuilder took 536.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 11.5 GB. [2018-12-03 00:22:55,623 INFO L168 Benchmark]: TraceAbstraction took 31084.22 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-03 00:22:55,623 INFO L168 Benchmark]: Witness Printer took 95.09 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 86.0 kB). Peak memory consumption was 86.0 kB. Max. memory is 11.5 GB. [2018-12-03 00:22:55,625 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 536.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31084.22 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 95.09 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 86.0 kB). Peak memory consumption was 86.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((!(1 == \old(a21)) || ((!(a7 == 1) && a16 == 4) && !(a17 == 1))) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || (((!(a7 == 1) && !(a16 == 6)) && 1 == a21) && 15 == a8)) || (((!(a16 == 6) && !(a17 == 1)) && !(a16 == 4)) && 14 <= a8)) || ((!(a7 == 1) && 15 <= a8) && a16 == 4)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && 1 == a17)) || ((1 == a21 && !(a7 == 1) && a20 <= 0) && 15 == a8)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || (((a21 <= 0 && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20)) || (((!(a7 == 1) && \old(a20) == a20) && 1 == a21) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 31.0s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 22.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 752 SDtfs, 13243 SDslu, 1097 SDs, 0 SdLazy, 13396 SolverSat, 2345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2804 GetRequests, 2552 SyntacticMatches, 17 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5741occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9968725649768959 AbsIntWeakeningRatio, 0.23597122302158274 AbsIntAvgWeakeningVarsNumRemoved, 28.54820143884892 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1934 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 250 PreInvPairs, 364 NumberOfFragments, 1012 HoareAnnotationTreeSize, 250 FomulaSimplifications, 40324 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 40189 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3267 NumberOfCodeBlocks, 3267 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4150 ConstructedInterpolants, 0 QuantifiedInterpolants, 2740419 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2554 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 2885/3188 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...