./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label05_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_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/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 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:51:10,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:51:10,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:51:10,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:51:10,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:51:10,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:51:10,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:51:10,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:51:10,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:51:10,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:51:10,492 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:51:10,492 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:51:10,493 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:51:10,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:51:10,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:51:10,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:51:10,494 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:51:10,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:51:10,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:51:10,497 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:51:10,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:51:10,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:51:10,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:51:10,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:51:10,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:51:10,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:51:10,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:51:10,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:51:10,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:51:10,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:51:10,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:51:10,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:51:10,502 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:51:10,502 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:51:10,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:51:10,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:51:10,503 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:51:10,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:51:10,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:51:10,510 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:51:10,510 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:51:10,510 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:51:10,510 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:51:10,511 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:51:10,511 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:51:10,511 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:51:10,511 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:51:10,511 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:51:10,511 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:51:10,511 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:51:10,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:51:10,511 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:51:10,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:51:10,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:51:10,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:51:10,513 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/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 -> 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f [2018-12-08 17:51:10,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:51:10,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:51:10,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:51:10,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:51:10,540 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:51:10,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-12-08 17:51:10,576 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/data/b04f2ae47/50ba8300a3464423b4ce7c8c769e0f5b/FLAGc4b2b741b [2018-12-08 17:51:10,912 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:51:10,912 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/sv-benchmarks/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-12-08 17:51:10,920 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/data/b04f2ae47/50ba8300a3464423b4ce7c8c769e0f5b/FLAGc4b2b741b [2018-12-08 17:51:11,304 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/data/b04f2ae47/50ba8300a3464423b4ce7c8c769e0f5b [2018-12-08 17:51:11,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:51:11,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:51:11,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:51:11,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:51:11,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:51:11,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9438d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11, skipping insertion in model container [2018-12-08 17:51:11,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:51:11,348 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:51:11,538 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:51:11,541 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:51:11,642 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:51:11,655 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:51:11,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11 WrapperNode [2018-12-08 17:51:11,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:51:11,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:51:11,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:51:11,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:51:11,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:51:11,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:51:11,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:51:11,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:51:11,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... [2018-12-08 17:51:11,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:51:11,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:51:11,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:51:11,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:51:11,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/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-08 17:51:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:51:11,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:51:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-08 17:51:11,774 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-08 17:51:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:51:11,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:51:11,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:51:11,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:51:12,337 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:51:12,337 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 17:51:12,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:51:12 BoogieIcfgContainer [2018-12-08 17:51:12,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:51:12,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:51:12,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:51:12,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:51:12,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:51:11" (1/3) ... [2018-12-08 17:51:12,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522cae11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:51:12, skipping insertion in model container [2018-12-08 17:51:12,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:51:11" (2/3) ... [2018-12-08 17:51:12,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522cae11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:51:12, skipping insertion in model container [2018-12-08 17:51:12,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:51:12" (3/3) ... [2018-12-08 17:51:12,342 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label05_true-unreach-call_false-termination.c [2018-12-08 17:51:12,348 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:51:12,353 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 17:51:12,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 17:51:12,383 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:51:12,383 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:51:12,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:51:12,383 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:51:12,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:51:12,383 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:51:12,383 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:51:12,383 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:51:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-08 17:51:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 17:51:12,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:12,403 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] [2018-12-08 17:51:12,404 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:12,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:12,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1904695938, now seen corresponding path program 1 times [2018-12-08 17:51:12,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:12,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:12,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:12,639 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-08 17:51:12,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:51:12,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:51:12,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:51:12,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:51:12,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:51:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:51:12,654 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-12-08 17:51:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:13,079 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-12-08 17:51:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:51:13,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-08 17:51:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:13,088 INFO L225 Difference]: With dead ends: 547 [2018-12-08 17:51:13,088 INFO L226 Difference]: Without dead ends: 278 [2018-12-08 17:51:13,091 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-08 17:51:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-08 17:51:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-08 17:51:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-08 17:51:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 400 transitions. [2018-12-08 17:51:13,125 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 400 transitions. Word has length 100 [2018-12-08 17:51:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:13,126 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 400 transitions. [2018-12-08 17:51:13,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:51:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 400 transitions. [2018-12-08 17:51:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 17:51:13,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:13,128 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] [2018-12-08 17:51:13,129 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:13,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1236531093, now seen corresponding path program 1 times [2018-12-08 17:51:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:13,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:13,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:13,219 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-08 17:51:13,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:51:13,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:51:13,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:51:13,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:51:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:51:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:51:13,222 INFO L87 Difference]: Start difference. First operand 278 states and 400 transitions. Second operand 6 states. [2018-12-08 17:51:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:13,563 INFO L93 Difference]: Finished difference Result 703 states and 1026 transitions. [2018-12-08 17:51:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:51:13,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-08 17:51:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:13,566 INFO L225 Difference]: With dead ends: 703 [2018-12-08 17:51:13,566 INFO L226 Difference]: Without dead ends: 431 [2018-12-08 17:51:13,567 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-08 17:51:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-08 17:51:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 419. [2018-12-08 17:51:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-08 17:51:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2018-12-08 17:51:13,583 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 110 [2018-12-08 17:51:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:13,583 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2018-12-08 17:51:13,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:51:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2018-12-08 17:51:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 17:51:13,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:13,585 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] [2018-12-08 17:51:13,586 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:13,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash 235879383, now seen corresponding path program 1 times [2018-12-08 17:51:13,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:13,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:13,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:13,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:13,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:13,639 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-08 17:51:13,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:51:13,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:51:13,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:51:13,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:51:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:51:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:51:13,640 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 3 states. [2018-12-08 17:51:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:13,900 INFO L93 Difference]: Finished difference Result 1241 states and 1781 transitions. [2018-12-08 17:51:13,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:51:13,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-08 17:51:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:13,905 INFO L225 Difference]: With dead ends: 1241 [2018-12-08 17:51:13,905 INFO L226 Difference]: Without dead ends: 828 [2018-12-08 17:51:13,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:51:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-12-08 17:51:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2018-12-08 17:51:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-12-08 17:51:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1140 transitions. [2018-12-08 17:51:13,933 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1140 transitions. Word has length 111 [2018-12-08 17:51:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:13,933 INFO L480 AbstractCegarLoop]: Abstraction has 828 states and 1140 transitions. [2018-12-08 17:51:13,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:51:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1140 transitions. [2018-12-08 17:51:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-08 17:51:13,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:13,938 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:51:13,938 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:13,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1258087941, now seen corresponding path program 1 times [2018-12-08 17:51:13,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:13,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:13,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:13,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:13,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:51:14,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:51:14,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:51:14,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:51:14,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:51:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:51:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:51:14,002 INFO L87 Difference]: Start difference. First operand 828 states and 1140 transitions. Second operand 6 states. [2018-12-08 17:51:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:14,418 INFO L93 Difference]: Finished difference Result 2250 states and 3291 transitions. [2018-12-08 17:51:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:51:14,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-08 17:51:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:14,427 INFO L225 Difference]: With dead ends: 2250 [2018-12-08 17:51:14,427 INFO L226 Difference]: Without dead ends: 1428 [2018-12-08 17:51:14,430 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-08 17:51:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2018-12-08 17:51:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1400. [2018-12-08 17:51:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2018-12-08 17:51:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1852 transitions. [2018-12-08 17:51:14,474 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1852 transitions. Word has length 125 [2018-12-08 17:51:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:14,474 INFO L480 AbstractCegarLoop]: Abstraction has 1400 states and 1852 transitions. [2018-12-08 17:51:14,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:51:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1852 transitions. [2018-12-08 17:51:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 17:51:14,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:14,478 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:51:14,478 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:14,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:14,479 INFO L82 PathProgramCache]: Analyzing trace with hash -676972618, now seen corresponding path program 1 times [2018-12-08 17:51:14,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:14,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:14,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:14,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:51:14,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:14,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:51:14,569 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-12-08 17:51:14,570 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [445], [447], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 17:51:14,598 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:51:14,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:51:14,971 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 17:51:14,972 INFO L272 AbstractInterpreter]: Visited 104 different actions 201 times. Merged at 3 different actions 3 times. Never widened. Performed 2886 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2886 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-08 17:51:14,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:14,981 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 17:51:15,174 INFO L227 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 81.59% of their original sizes. [2018-12-08 17:51:15,174 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 17:51:15,234 INFO L418 sIntCurrentIteration]: We unified 141 AI predicates to 141 [2018-12-08 17:51:15,234 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 17:51:15,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:51:15,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-08 17:51:15,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:51:15,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:51:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:51:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:51:15,236 INFO L87 Difference]: Start difference. First operand 1400 states and 1852 transitions. Second operand 10 states. [2018-12-08 17:51:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:17,743 INFO L93 Difference]: Finished difference Result 3587 states and 4823 transitions. [2018-12-08 17:51:17,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 17:51:17,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2018-12-08 17:51:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:17,747 INFO L225 Difference]: With dead ends: 3587 [2018-12-08 17:51:17,748 INFO L226 Difference]: Without dead ends: 2193 [2018-12-08 17:51:17,749 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:51:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-12-08 17:51:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1543. [2018-12-08 17:51:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1543 states. [2018-12-08 17:51:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2017 transitions. [2018-12-08 17:51:17,774 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2017 transitions. Word has length 142 [2018-12-08 17:51:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:17,775 INFO L480 AbstractCegarLoop]: Abstraction has 1543 states and 2017 transitions. [2018-12-08 17:51:17,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:51:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2017 transitions. [2018-12-08 17:51:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 17:51:17,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:17,777 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1] [2018-12-08 17:51:17,777 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:17,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash 818674521, now seen corresponding path program 1 times [2018-12-08 17:51:17,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:17,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:17,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 55 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 17:51:17,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:17,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:51:17,846 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-12-08 17:51:17,846 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [445], [447], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 17:51:17,850 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:51:17,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:51:17,965 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 17:51:17,966 INFO L272 AbstractInterpreter]: Visited 105 different actions 204 times. Merged at 4 different actions 4 times. Never widened. Performed 2774 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2774 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-08 17:51:17,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:17,969 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 17:51:18,109 INFO L227 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 81.57% of their original sizes. [2018-12-08 17:51:18,109 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 17:51:18,163 INFO L418 sIntCurrentIteration]: We unified 153 AI predicates to 153 [2018-12-08 17:51:18,163 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 17:51:18,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:51:18,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-08 17:51:18,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:51:18,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:51:18,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:51:18,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:51:18,164 INFO L87 Difference]: Start difference. First operand 1543 states and 2017 transitions. Second operand 10 states. [2018-12-08 17:51:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:20,069 INFO L93 Difference]: Finished difference Result 3354 states and 4356 transitions. [2018-12-08 17:51:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:51:20,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-12-08 17:51:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:20,073 INFO L225 Difference]: With dead ends: 3354 [2018-12-08 17:51:20,073 INFO L226 Difference]: Without dead ends: 1817 [2018-12-08 17:51:20,075 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 161 GetRequests, 145 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-08 17:51:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-12-08 17:51:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1815. [2018-12-08 17:51:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2018-12-08 17:51:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2315 transitions. [2018-12-08 17:51:20,100 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2315 transitions. Word has length 154 [2018-12-08 17:51:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:20,100 INFO L480 AbstractCegarLoop]: Abstraction has 1815 states and 2315 transitions. [2018-12-08 17:51:20,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:51:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2315 transitions. [2018-12-08 17:51:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 17:51:20,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:20,103 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2018-12-08 17:51:20,103 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:20,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:20,104 INFO L82 PathProgramCache]: Analyzing trace with hash 740799730, now seen corresponding path program 1 times [2018-12-08 17:51:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:20,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:20,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 17:51:20,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:20,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:51:20,146 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2018-12-08 17:51:20,146 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [445], [447], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 17:51:20,150 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:51:20,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:51:20,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:51:20,304 INFO L272 AbstractInterpreter]: Visited 107 different actions 315 times. Merged at 6 different actions 16 times. Never widened. Performed 4459 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4459 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-08 17:51:20,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:20,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:51:20,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:20,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/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-08 17:51:20,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:20,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:51:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:20,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:51:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 17:51:20,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:51:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 17:51:20,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:51:20,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-12-08 17:51:20,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:51:20,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:51:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:51:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:51:20,539 INFO L87 Difference]: Start difference. First operand 1815 states and 2315 transitions. Second operand 8 states. [2018-12-08 17:51:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:21,956 INFO L93 Difference]: Finished difference Result 6132 states and 8226 transitions. [2018-12-08 17:51:21,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 17:51:21,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 165 [2018-12-08 17:51:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:21,968 INFO L225 Difference]: With dead ends: 6132 [2018-12-08 17:51:21,968 INFO L226 Difference]: Without dead ends: 4164 [2018-12-08 17:51:21,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-12-08 17:51:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4164 states. [2018-12-08 17:51:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4164 to 3449. [2018-12-08 17:51:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2018-12-08 17:51:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4061 transitions. [2018-12-08 17:51:22,033 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4061 transitions. Word has length 165 [2018-12-08 17:51:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:22,033 INFO L480 AbstractCegarLoop]: Abstraction has 3449 states and 4061 transitions. [2018-12-08 17:51:22,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:51:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4061 transitions. [2018-12-08 17:51:22,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-08 17:51:22,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:22,037 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 17:51:22,037 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:22,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1946877733, now seen corresponding path program 1 times [2018-12-08 17:51:22,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:22,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:22,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:22,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:22,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 17:51:22,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:22,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:51:22,128 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-12-08 17:51:22,128 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [445], [447], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 17:51:22,131 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:51:22,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:51:22,255 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 17:51:22,255 INFO L272 AbstractInterpreter]: Visited 105 different actions 204 times. Merged at 4 different actions 4 times. Never widened. Performed 2826 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2826 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-08 17:51:22,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:22,256 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 17:51:22,387 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 81.57% of their original sizes. [2018-12-08 17:51:22,387 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 17:51:22,429 INFO L418 sIntCurrentIteration]: We unified 186 AI predicates to 186 [2018-12-08 17:51:22,429 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 17:51:22,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:51:22,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-08 17:51:22,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:51:22,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:51:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:51:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:51:22,430 INFO L87 Difference]: Start difference. First operand 3449 states and 4061 transitions. Second operand 10 states. [2018-12-08 17:51:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:24,732 INFO L93 Difference]: Finished difference Result 6229 states and 7338 transitions. [2018-12-08 17:51:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:51:24,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2018-12-08 17:51:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:24,739 INFO L225 Difference]: With dead ends: 6229 [2018-12-08 17:51:24,739 INFO L226 Difference]: Without dead ends: 3862 [2018-12-08 17:51:24,742 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 178 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-08 17:51:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2018-12-08 17:51:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3860. [2018-12-08 17:51:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3860 states. [2018-12-08 17:51:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 4509 transitions. [2018-12-08 17:51:24,832 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 4509 transitions. Word has length 187 [2018-12-08 17:51:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:24,832 INFO L480 AbstractCegarLoop]: Abstraction has 3860 states and 4509 transitions. [2018-12-08 17:51:24,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:51:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 4509 transitions. [2018-12-08 17:51:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-08 17:51:24,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:24,838 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 17:51:24,838 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:24,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash 903317792, now seen corresponding path program 1 times [2018-12-08 17:51:24,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:24,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:24,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 51 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 17:51:24,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:24,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:51:24,922 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-08 17:51:24,923 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [445], [447], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 17:51:24,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:51:24,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:51:25,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:51:25,174 INFO L272 AbstractInterpreter]: Visited 107 different actions 426 times. Merged at 8 different actions 31 times. Never widened. Performed 6200 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6200 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-08 17:51:25,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:25,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:51:25,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:25,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/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-08 17:51:25,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:25,186 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:51:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:25,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:51:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-08 17:51:25,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:51:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 97 proven. 44 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 17:51:25,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:51:25,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-08 17:51:25,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:51:25,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:51:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:51:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:51:25,333 INFO L87 Difference]: Start difference. First operand 3860 states and 4509 transitions. Second operand 11 states. [2018-12-08 17:51:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:26,058 INFO L93 Difference]: Finished difference Result 8775 states and 10297 transitions. [2018-12-08 17:51:26,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:51:26,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 195 [2018-12-08 17:51:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:26,067 INFO L225 Difference]: With dead ends: 8775 [2018-12-08 17:51:26,067 INFO L226 Difference]: Without dead ends: 5467 [2018-12-08 17:51:26,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:51:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2018-12-08 17:51:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 5181. [2018-12-08 17:51:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5181 states. [2018-12-08 17:51:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 5960 transitions. [2018-12-08 17:51:26,130 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 5960 transitions. Word has length 195 [2018-12-08 17:51:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:26,131 INFO L480 AbstractCegarLoop]: Abstraction has 5181 states and 5960 transitions. [2018-12-08 17:51:26,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:51:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 5960 transitions. [2018-12-08 17:51:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-08 17:51:26,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:26,136 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 17:51:26,136 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:26,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash 355755510, now seen corresponding path program 2 times [2018-12-08 17:51:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:26,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:26,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 53 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 17:51:26,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:26,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:51:26,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 17:51:26,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 17:51:26,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:26,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/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-08 17:51:26,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 17:51:26,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 17:51:26,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 17:51:26,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:51:26,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:51:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-08 17:51:26,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:51:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-08 17:51:26,379 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:51:26,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-12-08 17:51:26,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:51:26,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:51:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:51:26,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:51:26,380 INFO L87 Difference]: Start difference. First operand 5181 states and 5960 transitions. Second operand 3 states. [2018-12-08 17:51:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:26,584 INFO L93 Difference]: Finished difference Result 5590 states and 6468 transitions. [2018-12-08 17:51:26,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:51:26,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-12-08 17:51:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:26,597 INFO L225 Difference]: With dead ends: 5590 [2018-12-08 17:51:26,597 INFO L226 Difference]: Without dead ends: 5588 [2018-12-08 17:51:26,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:51:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2018-12-08 17:51:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 5316. [2018-12-08 17:51:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-12-08 17:51:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 6116 transitions. [2018-12-08 17:51:26,675 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 6116 transitions. Word has length 195 [2018-12-08 17:51:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:26,675 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 6116 transitions. [2018-12-08 17:51:26,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:51:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 6116 transitions. [2018-12-08 17:51:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-08 17:51:26,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:26,682 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:51:26,682 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:51:26,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1625704153, now seen corresponding path program 1 times [2018-12-08 17:51:26,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:51:26,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:26,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:51:26,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:26,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:51:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 129 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-08 17:51:26,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:26,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:51:26,752 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-12-08 17:51:26,753 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [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], [205], [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], [445], [447], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 17:51:26,754 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:51:26,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:51:26,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:51:26,974 INFO L272 AbstractInterpreter]: Visited 108 different actions 435 times. Merged at 9 different actions 36 times. Widened at 1 different actions 1 times. Performed 6381 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6381 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-08 17:51:26,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:26,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:51:26,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:26,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/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-08 17:51:26,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:26,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:51:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:27,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:51:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-08 17:51:27,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:51:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 134 proven. 20 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-08 17:51:27,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:51:27,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-12-08 17:51:27,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:51:27,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:51:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:51:27,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:51:27,159 INFO L87 Difference]: Start difference. First operand 5316 states and 6116 transitions. Second operand 12 states. [2018-12-08 17:51:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:29,288 INFO L93 Difference]: Finished difference Result 15425 states and 18902 transitions. [2018-12-08 17:51:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-08 17:51:29,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 231 [2018-12-08 17:51:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:29,289 INFO L225 Difference]: With dead ends: 15425 [2018-12-08 17:51:29,289 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 17:51:29,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 491 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=444, Invalid=1718, Unknown=0, NotChecked=0, Total=2162 [2018-12-08 17:51:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 17:51:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 17:51:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 17:51:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 17:51:29,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2018-12-08 17:51:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:29,306 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:51:29,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:51:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 17:51:29,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 17:51:29,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 17:51:29,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,812 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 184 [2018-12-08 17:51:29,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:29,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:30,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:30,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:30,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:30,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:30,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:30,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:51:30,067 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 195 [2018-12-08 17:51:30,998 WARN L180 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 97 [2018-12-08 17:51:31,436 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 71 [2018-12-08 17:51:31,893 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 68 [2018-12-08 17:51:31,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 17:51:31,894 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a16~0)| ~a16~0)) [2018-12-08 17:51:31,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 17:51:31,894 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-08 17:51:31,894 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-08 17:51:31,894 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,894 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-08 17:51:31,895 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-08 17:51:31,896 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,897 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-08 17:51:31,898 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-08 17:51:31,899 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-08 17:51:31,900 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~a7~0 |old(~a7~0)|)) (.cse10 (= |old(~a8~0)| ~a8~0)) (.cse6 (= |old(~a20~0)| ~a20~0)) (.cse11 (= ~a17~0 |old(~a17~0)|)) (.cse7 (= |old(~a16~0)| ~a16~0)) (.cse13 (= 1 |old(~a17~0)|)) (.cse2 (= 1 |old(~a21~0)|)) (.cse16 (= 6 |old(~a16~0)|)) (.cse0 (< 13 |old(~a8~0)|)) (.cse19 (= ~a21~0 1))) (let ((.cse8 (not .cse19)) (.cse14 (or .cse16 .cse0)) (.cse4 (not (= 1 |old(~a7~0)|))) (.cse1 (= 4 |old(~a16~0)|)) (.cse24 (= 0 |old(~a16~0)|)) (.cse3 (not (= |old(~a20~0)| 1))) (.cse5 (< 0 |old(~a17~0)|)) (.cse21 (= |calculate_output_#in~input| 0)) (.cse17 (not (= 0 |old(~a7~0)|))) (.cse18 (not .cse2)) (.cse23 (not (= 15 |old(~a8~0)|))) (.cse20 (not (= 8 ~a12~0))) (.cse26 (not .cse13)) (.cse12 (and .cse9 .cse10 .cse6 .cse11 .cse7)) (.cse25 (= 13 |old(~a8~0)|)) (.cse15 (< 0 |old(~a20~0)|)) (.cse22 (not (= 1 |old(~a20~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (or .cse12 .cse13 .cse14 .cse15) (or (and .cse8 .cse9 .cse10 .cse6 .cse11 .cse7) .cse2 .cse14 .cse15) (or .cse16 .cse17 .cse18 .cse19 .cse20 .cse5 .cse21 .cse22 .cse23 .cse24) (or (and (= 1 ~a7~0) .cse10 .cse6 .cse11 .cse7) .cse5 (or .cse16 .cse25 .cse4)) (or .cse16 (= |old(~a7~0)| 1) .cse0 (and .cse9 .cse10 .cse7)) (or .cse1 .cse22 .cse12 .cse25 .cse13) (or .cse21 .cse19 (or (not .cse16) .cse17 .cse18 .cse22 .cse23 (not (= 0 |old(~a17~0)|)) .cse20)) (or (and .cse9 (and .cse10 .cse7 (= ~a17~0 1) .cse19 (= ~a20~0 1))) (or .cse18 .cse22 .cse24 .cse20 .cse21 (= 0 |old(~a8~0)|) .cse26)) (or .cse16 .cse12 .cse3 .cse5) (or .cse21 (or .cse17 .cse18 .cse23 (not (= 0 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) .cse20 .cse26) .cse19) (or .cse12 .cse25 .cse15) (or (and .cse9 .cse10 (= 1 ~a20~0) .cse11 .cse7) (or .cse16 .cse0 .cse22))))) [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-08 17:51:31,901 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-08 17:51:31,902 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-08 17:51:31,903 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-08 17:51:31,904 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 17:51:31,905 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-12-08 17:51:31,905 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 17:51:31,905 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)|)) (and (= ~a21~0 1) (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-12-08 17:51:31,905 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-12-08 17:51:31,906 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse5 (= ~a21~0 1))) (let ((.cse8 (not .cse5)) (.cse6 (= 1 ~a7~0)) (.cse1 (<= ~a20~0 0)) (.cse7 (<= ~a17~0 0)) (.cse2 (<= ~a8~0 13)) (.cse3 (not (= ~a16~0 6))) (.cse9 (= 1 ~a20~0)) (.cse10 (not .cse4)) (.cse0 (not (= ~a8~0 13)))) (or (and .cse0 .cse1) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse2 (= ~a7~0 |old(~a7~0)|) .cse3) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and (not (= ~a16~0 0)) (not (= main_~input~0 0)) (not (= ~a8~0 0)) .cse4 .cse5 (= ~a20~0 1)) (and (and .cse6 .cse3 .cse0) .cse7) (and .cse8 .cse3 .cse1) (and .cse8 .cse6 .cse9 .cse7) (and .cse3 .cse10 .cse1) (and .cse9 .cse7 .cse0) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse2 .cse9 .cse3) (and .cse9 .cse10 .cse0 (not (= ~a16~0 4)))))) [2018-12-08 17:51:31,906 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-12-08 17:51:31,906 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-08 17:51:31,906 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a21~0 1))) (let ((.cse6 (not .cse10)) (.cse4 (= 1 ~a7~0)) (.cse1 (<= ~a20~0 0)) (.cse5 (<= ~a17~0 0)) (.cse2 (<= ~a8~0 13)) (.cse3 (not (= ~a16~0 6))) (.cse7 (= 1 ~a20~0)) (.cse8 (not .cse9)) (.cse0 (not (= ~a8~0 13)))) (or (and .cse0 .cse1) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse2 (= ~a7~0 |old(~a7~0)|) .cse3) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and (and .cse4 .cse3 .cse0) .cse5) (and .cse6 .cse3 .cse1) (and .cse6 .cse4 .cse7 .cse5) (and .cse3 .cse8 .cse1) (and .cse7 .cse5 .cse0) (not (= 0 |old(~a7~0)|)) (and (not (= ~a16~0 0)) (not (= ~a8~0 0)) .cse9 .cse10 (= ~a20~0 1)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse2 .cse7 .cse3) (and .cse7 .cse8 .cse0 (not (= ~a16~0 4)))))) [2018-12-08 17:51:31,906 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-12-08 17:51:31,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:51:31 BoogieIcfgContainer [2018-12-08 17:51:31,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:51:31,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:51:31,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:51:31,916 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:51:31,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:51:12" (3/4) ... [2018-12-08 17:51:31,918 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 17:51:31,922 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 17:51:31,922 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-08 17:51:31,922 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 17:51:31,928 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-08 17:51:31,928 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 17:51:31,946 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(a8 == 13) && a20 <= 0) || !(1 == \old(a20))) || !(5 == \old(a16))) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || !(1 == \old(a21))) || !(8 == a12)) || (((1 == a7 && !(a16 == 6)) && !(a8 == 13)) && a17 <= 0)) || ((!(a21 == 1) && !(a16 == 6)) && a20 <= 0)) || (((!(a21 == 1) && 1 == a7) && 1 == a20) && a17 <= 0)) || ((!(a16 == 6) && !(a17 == 1)) && a20 <= 0)) || ((1 == a20 && a17 <= 0) && !(a8 == 13))) || !(0 == \old(a7))) || ((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a21 == 1) && a20 == 1)) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((a8 <= 13 && 1 == a20) && !(a16 == 6))) || (((1 == a20 && !(a17 == 1)) && !(a8 == 13)) && !(a16 == 4)) [2018-12-08 17:51:32,002 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5d910e26-f1e3-414a-951e-ad3d85d9d831/bin-2019/utaipan/witness.graphml [2018-12-08 17:51:32,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:51:32,003 INFO L168 Benchmark]: Toolchain (without parser) took 20694.99 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 947.0 MB in the beginning and 1.6 GB in the end (delta: -643.7 MB). Peak memory consumption was 538.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:51:32,003 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:51:32,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:51:32,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:51:32,004 INFO L168 Benchmark]: Boogie Preprocessor took 45.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:51:32,004 INFO L168 Benchmark]: RCFGBuilder took 607.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.6 MB in the end (delta: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. [2018-12-08 17:51:32,005 INFO L168 Benchmark]: TraceAbstraction took 19577.54 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 999.6 MB in the beginning and 1.6 GB in the end (delta: -616.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-08 17:51:32,005 INFO L168 Benchmark]: Witness Printer took 86.99 ms. Allocated memory is still 2.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:51:32,006 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 607.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.6 MB in the end (delta: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19577.54 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 999.6 MB in the beginning and 1.6 GB in the end (delta: -616.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 86.99 ms. Allocated memory is still 2.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: 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: ((((((((((((((((!(a8 == 13) && a20 <= 0) || !(1 == \old(a20))) || !(5 == \old(a16))) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || !(1 == \old(a21))) || !(8 == a12)) || (((1 == a7 && !(a16 == 6)) && !(a8 == 13)) && a17 <= 0)) || ((!(a21 == 1) && !(a16 == 6)) && a20 <= 0)) || (((!(a21 == 1) && 1 == a7) && 1 == a20) && a17 <= 0)) || ((!(a16 == 6) && !(a17 == 1)) && a20 <= 0)) || ((1 == a20 && a17 <= 0) && !(a8 == 13))) || !(0 == \old(a7))) || ((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a21 == 1) && a20 == 1)) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((a8 <= 13 && 1 == a20) && !(a16 == 6))) || (((1 == a20 && !(a17 == 1)) && !(a8 == 13)) && !(a16 == 4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 19.5s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 672 SDtfs, 9182 SDslu, 798 SDs, 0 SdLazy, 11898 SolverSat, 2015 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2250 GetRequests, 2080 SyntacticMatches, 7 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5316occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.9967938662192112 AbsIntWeakeningRatio, 0.24375 AbsIntAvgWeakeningVarsNumRemoved, 29.045833333333334 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1967 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 265 PreInvPairs, 513 NumberOfFragments, 839 HoareAnnotationTreeSize, 265 FomulaSimplifications, 31482 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 20903 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2501 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1118957 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2172 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 2081/2387 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...