./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/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 bab2da56573ef206e3542dbf4ea35e0da738901e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 11:59:31,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:59:31,475 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:59:31,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:59:31,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:59:31,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:59:31,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:59:31,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:59:31,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:59:31,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:59:31,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:59:31,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:59:31,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:59:31,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:59:31,489 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:59:31,489 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:59:31,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:59:31,491 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:59:31,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:59:31,494 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:59:31,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:59:31,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:59:31,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:59:31,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:59:31,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:59:31,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:59:31,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:59:31,499 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:59:31,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:59:31,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:59:31,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:59:31,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:59:31,501 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:59:31,501 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:59:31,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:59:31,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:59:31,503 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 11:59:31,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:59:31,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:59:31,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:59:31,514 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:59:31,514 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 11:59:31,514 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 11:59:31,515 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 11:59:31,515 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 11:59:31,515 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 11:59:31,515 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 11:59:31,515 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 11:59:31,515 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 11:59:31,515 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 11:59:31,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:59:31,516 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:59:31,516 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:59:31,516 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:59:31,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:59:31,517 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:59:31,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:59:31,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:59:31,517 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:59:31,517 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:59:31,517 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:59:31,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:59:31,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:59:31,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:59:31,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:59:31,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:59:31,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:59:31,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:59:31,519 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:59:31,519 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:59:31,519 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 11:59:31,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:59:31,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:59:31,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:59:31,519 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_51c0c456-51dc-4103-b497-85ecf0842bbc/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 -> bab2da56573ef206e3542dbf4ea35e0da738901e [2018-11-23 11:59:31,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:59:31,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:59:31,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:59:31,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:59:31,558 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:59:31,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-11-23 11:59:31,603 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/data/8e59f20f9/6fe9e10cd9e94ae39e33afa600988852/FLAG606d79b45 [2018-11-23 11:59:32,062 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:59:32,063 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/sv-benchmarks/c/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-11-23 11:59:32,072 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/data/8e59f20f9/6fe9e10cd9e94ae39e33afa600988852/FLAG606d79b45 [2018-11-23 11:59:32,576 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/data/8e59f20f9/6fe9e10cd9e94ae39e33afa600988852 [2018-11-23 11:59:32,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:59:32,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:59:32,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:32,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:59:32,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:59:32,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:32,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c8d80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32, skipping insertion in model container [2018-11-23 11:59:32,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:32,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:59:32,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:59:32,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:32,849 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:59:32,915 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:59:32,928 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:59:32,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32 WrapperNode [2018-11-23 11:59:32,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:59:32,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:32,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:59:32,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:59:32,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:32,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:33,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:59:33,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:59:33,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:59:33,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:59:33,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:33,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:33,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:33,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:33,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:33,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:33,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... [2018-11-23 11:59:33,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:59:33,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:59:33,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:59:33,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:59:33,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:59:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:59:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:59:33,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:59:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-23 11:59:33,097 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-23 11:59:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:59:33,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:59:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:59:33,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:59:33,821 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:59:33,821 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:59:33,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:33 BoogieIcfgContainer [2018-11-23 11:59:33,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:59:33,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:59:33,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:59:33,824 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:59:33,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:59:32" (1/3) ... [2018-11-23 11:59:33,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6957169f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:33, skipping insertion in model container [2018-11-23 11:59:33,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:59:32" (2/3) ... [2018-11-23 11:59:33,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6957169f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:59:33, skipping insertion in model container [2018-11-23 11:59:33,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:33" (3/3) ... [2018-11-23 11:59:33,826 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-11-23 11:59:33,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:59:33,838 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:59:33,847 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:59:33,868 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:59:33,868 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:59:33,868 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:59:33,869 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:59:33,869 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:59:33,869 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:59:33,869 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:59:33,869 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:59:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-11-23 11:59:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-23 11:59:33,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:33,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:33,894 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:33,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash 597031182, now seen corresponding path program 1 times [2018-11-23 11:59:33,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:33,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:34,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:34,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:34,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:34,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:34,250 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-11-23 11:59:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,720 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-11-23 11:59:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:34,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-11-23 11:59:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:34,732 INFO L225 Difference]: With dead ends: 547 [2018-11-23 11:59:34,732 INFO L226 Difference]: Without dead ends: 338 [2018-11-23 11:59:34,735 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-11-23 11:59:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-23 11:59:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-11-23 11:59:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-23 11:59:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 560 transitions. [2018-11-23 11:59:34,775 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 560 transitions. Word has length 120 [2018-11-23 11:59:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:34,776 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 560 transitions. [2018-11-23 11:59:34,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 560 transitions. [2018-11-23 11:59:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 11:59:34,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:34,781 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:34,781 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:34,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash 330455461, now seen corresponding path program 1 times [2018-11-23 11:59:34,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:34,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:34,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:34,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:34,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:59:34,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:34,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:59:34,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:59:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:59:34,918 INFO L87 Difference]: Start difference. First operand 338 states and 560 transitions. Second operand 6 states. [2018-11-23 11:59:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:35,525 INFO L93 Difference]: Finished difference Result 881 states and 1484 transitions. [2018-11-23 11:59:35,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:35,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-23 11:59:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:35,529 INFO L225 Difference]: With dead ends: 881 [2018-11-23 11:59:35,529 INFO L226 Difference]: Without dead ends: 549 [2018-11-23 11:59:35,531 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-11-23 11:59:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-11-23 11:59:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 536. [2018-11-23 11:59:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-23 11:59:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 824 transitions. [2018-11-23 11:59:35,557 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 824 transitions. Word has length 130 [2018-11-23 11:59:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:35,558 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 824 transitions. [2018-11-23 11:59:35,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:59:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 824 transitions. [2018-11-23 11:59:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 11:59:35,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:35,561 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:35,561 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:35,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash -46995225, now seen corresponding path program 1 times [2018-11-23 11:59:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:35,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:35,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:35,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:59:35,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:35,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:59:35,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:59:35,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:35,748 INFO L87 Difference]: Start difference. First operand 536 states and 824 transitions. Second operand 5 states. [2018-11-23 11:59:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:36,217 INFO L93 Difference]: Finished difference Result 1203 states and 1889 transitions. [2018-11-23 11:59:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:59:36,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2018-11-23 11:59:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:36,220 INFO L225 Difference]: With dead ends: 1203 [2018-11-23 11:59:36,220 INFO L226 Difference]: Without dead ends: 533 [2018-11-23 11:59:36,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-11-23 11:59:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2018-11-23 11:59:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-23 11:59:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 784 transitions. [2018-11-23 11:59:36,237 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 784 transitions. Word has length 131 [2018-11-23 11:59:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:36,237 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 784 transitions. [2018-11-23 11:59:36,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:59:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 784 transitions. [2018-11-23 11:59:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 11:59:36,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:36,240 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:36,240 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:36,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1746951265, now seen corresponding path program 1 times [2018-11-23 11:59:36,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:36,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:36,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:36,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:36,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:36,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:36,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:59:36,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:36,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:59:36,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:59:36,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:36,478 INFO L87 Difference]: Start difference. First operand 533 states and 784 transitions. Second operand 5 states. [2018-11-23 11:59:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:36,876 INFO L93 Difference]: Finished difference Result 1197 states and 1792 transitions. [2018-11-23 11:59:36,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:59:36,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-23 11:59:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:36,879 INFO L225 Difference]: With dead ends: 1197 [2018-11-23 11:59:36,879 INFO L226 Difference]: Without dead ends: 532 [2018-11-23 11:59:36,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:59:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-11-23 11:59:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2018-11-23 11:59:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-23 11:59:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 779 transitions. [2018-11-23 11:59:36,890 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 779 transitions. Word has length 132 [2018-11-23 11:59:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:36,890 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 779 transitions. [2018-11-23 11:59:36,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:59:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 779 transitions. [2018-11-23 11:59:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 11:59:36,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:36,892 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:36,892 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:36,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1219225115, now seen corresponding path program 1 times [2018-11-23 11:59:36,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:36,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:36,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:36,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:36,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:59:36,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:36,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:59:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:59:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:36,974 INFO L87 Difference]: Start difference. First operand 532 states and 779 transitions. Second operand 3 states. [2018-11-23 11:59:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:37,260 INFO L93 Difference]: Finished difference Result 1512 states and 2291 transitions. [2018-11-23 11:59:37,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:59:37,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-11-23 11:59:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:37,264 INFO L225 Difference]: With dead ends: 1512 [2018-11-23 11:59:37,264 INFO L226 Difference]: Without dead ends: 986 [2018-11-23 11:59:37,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:59:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-23 11:59:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2018-11-23 11:59:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-11-23 11:59:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1405 transitions. [2018-11-23 11:59:37,283 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1405 transitions. Word has length 137 [2018-11-23 11:59:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:37,284 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 1405 transitions. [2018-11-23 11:59:37,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:59:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1405 transitions. [2018-11-23 11:59:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-23 11:59:37,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:37,286 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:37,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:37,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1710204053, now seen corresponding path program 1 times [2018-11-23 11:59:37,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:37,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:37,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:37,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:59:37,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:59:37,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:37,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:59:37,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:59:37,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:59:37,345 INFO L87 Difference]: Start difference. First operand 986 states and 1405 transitions. Second operand 6 states. [2018-11-23 11:59:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:37,887 INFO L93 Difference]: Finished difference Result 2924 states and 4351 transitions. [2018-11-23 11:59:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:59:37,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-11-23 11:59:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:37,893 INFO L225 Difference]: With dead ends: 2924 [2018-11-23 11:59:37,894 INFO L226 Difference]: Without dead ends: 1944 [2018-11-23 11:59:37,897 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-11-23 11:59:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2018-11-23 11:59:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1917. [2018-11-23 11:59:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1917 states. [2018-11-23 11:59:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2543 transitions. [2018-11-23 11:59:37,932 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2543 transitions. Word has length 138 [2018-11-23 11:59:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:37,932 INFO L480 AbstractCegarLoop]: Abstraction has 1917 states and 2543 transitions. [2018-11-23 11:59:37,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:59:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2543 transitions. [2018-11-23 11:59:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 11:59:37,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:37,935 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:37,935 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:37,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2034569339, now seen corresponding path program 1 times [2018-11-23 11:59:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:37,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:37,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:59:38,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:38,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:38,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-11-23 11:59:38,021 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:38,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:38,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:38,380 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 11:59:38,381 INFO L272 AbstractInterpreter]: Visited 120 different actions 120 times. Never merged. Never widened. Performed 1602 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1602 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-11-23 11:59:38,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:38,394 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 11:59:38,611 INFO L227 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 80.47% of their original sizes. [2018-11-23 11:59:38,611 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 11:59:38,641 INFO L415 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2018-11-23 11:59:38,641 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 11:59:38,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:59:38,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-23 11:59:38,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:38,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:59:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:59:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:59:38,643 INFO L87 Difference]: Start difference. First operand 1917 states and 2543 transitions. Second operand 6 states. [2018-11-23 11:59:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:39,635 INFO L93 Difference]: Finished difference Result 3964 states and 5256 transitions. [2018-11-23 11:59:39,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:59:39,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-11-23 11:59:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:39,640 INFO L225 Difference]: With dead ends: 3964 [2018-11-23 11:59:39,640 INFO L226 Difference]: Without dead ends: 2053 [2018-11-23 11:59:39,643 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:59:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2018-11-23 11:59:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2052. [2018-11-23 11:59:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2018-11-23 11:59:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2684 transitions. [2018-11-23 11:59:39,672 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2684 transitions. Word has length 146 [2018-11-23 11:59:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:39,672 INFO L480 AbstractCegarLoop]: Abstraction has 2052 states and 2684 transitions. [2018-11-23 11:59:39,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:59:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2684 transitions. [2018-11-23 11:59:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 11:59:39,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:39,676 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:39,676 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:39,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2025242208, now seen corresponding path program 1 times [2018-11-23 11:59:39,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:39,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:39,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:39,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:39,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:39,731 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-11-23 11:59:39,731 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:39,733 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:39,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:39,931 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 11:59:39,931 INFO L272 AbstractInterpreter]: Visited 124 different actions 242 times. Merged at 4 different actions 4 times. Never widened. Performed 3208 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3208 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-11-23 11:59:39,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:39,942 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 11:59:40,115 INFO L227 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 81.93% of their original sizes. [2018-11-23 11:59:40,116 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 11:59:40,167 INFO L415 sIntCurrentIteration]: We unified 153 AI predicates to 153 [2018-11-23 11:59:40,167 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 11:59:40,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:59:40,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-23 11:59:40,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:40,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:59:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:59:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:59:40,168 INFO L87 Difference]: Start difference. First operand 2052 states and 2684 transitions. Second operand 10 states. [2018-11-23 11:59:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:43,643 INFO L93 Difference]: Finished difference Result 4102 states and 5400 transitions. [2018-11-23 11:59:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:59:43,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-11-23 11:59:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:43,651 INFO L225 Difference]: With dead ends: 4102 [2018-11-23 11:59:43,651 INFO L226 Difference]: Without dead ends: 2191 [2018-11-23 11:59:43,655 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-11-23 11:59:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2018-11-23 11:59:43,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2189. [2018-11-23 11:59:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2018-11-23 11:59:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2831 transitions. [2018-11-23 11:59:43,701 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2831 transitions. Word has length 154 [2018-11-23 11:59:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:43,701 INFO L480 AbstractCegarLoop]: Abstraction has 2189 states and 2831 transitions. [2018-11-23 11:59:43,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:59:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2831 transitions. [2018-11-23 11:59:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-23 11:59:43,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:43,707 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-23 11:59:43,707 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:43,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:43,707 INFO L82 PathProgramCache]: Analyzing trace with hash -495827166, now seen corresponding path program 1 times [2018-11-23 11:59:43,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:43,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:43,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:43,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:43,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 85 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:43,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:43,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:43,801 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-11-23 11:59:43,802 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:43,807 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:43,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:43,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 11:59:43,930 INFO L272 AbstractInterpreter]: Visited 124 different actions 242 times. Merged at 4 different actions 4 times. Never widened. Performed 3261 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3261 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-11-23 11:59:43,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:43,934 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 11:59:44,078 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 81.87% of their original sizes. [2018-11-23 11:59:44,078 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 11:59:44,127 INFO L415 sIntCurrentIteration]: We unified 186 AI predicates to 186 [2018-11-23 11:59:44,127 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 11:59:44,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:59:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-23 11:59:44,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:44,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:59:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:59:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:59:44,128 INFO L87 Difference]: Start difference. First operand 2189 states and 2831 transitions. Second operand 10 states. [2018-11-23 11:59:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:47,564 INFO L93 Difference]: Finished difference Result 4513 states and 5881 transitions. [2018-11-23 11:59:47,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:59:47,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2018-11-23 11:59:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:47,572 INFO L225 Difference]: With dead ends: 4513 [2018-11-23 11:59:47,572 INFO L226 Difference]: Without dead ends: 2602 [2018-11-23 11:59:47,577 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-11-23 11:59:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2018-11-23 11:59:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2600. [2018-11-23 11:59:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2018-11-23 11:59:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3264 transitions. [2018-11-23 11:59:47,626 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3264 transitions. Word has length 187 [2018-11-23 11:59:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:47,626 INFO L480 AbstractCegarLoop]: Abstraction has 2600 states and 3264 transitions. [2018-11-23 11:59:47,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:59:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3264 transitions. [2018-11-23 11:59:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-23 11:59:47,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:47,633 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2018-11-23 11:59:47,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:47,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1940598937, now seen corresponding path program 1 times [2018-11-23 11:59:47,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:47,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:47,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:47,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:47,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 71 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:59:47,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:47,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:47,743 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-23 11:59:47,743 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:47,746 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:47,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:47,977 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 11:59:47,977 INFO L272 AbstractInterpreter]: Visited 125 different actions 371 times. Merged at 7 different actions 16 times. Never widened. Performed 5003 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5003 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-23 11:59:47,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:47,982 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 11:59:48,267 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 83.63% of their original sizes. [2018-11-23 11:59:48,267 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 11:59:48,297 INFO L415 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-11-23 11:59:48,297 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 11:59:48,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:59:48,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-11-23 11:59:48,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:48,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:59:48,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:59:48,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:48,298 INFO L87 Difference]: Start difference. First operand 2600 states and 3264 transitions. Second operand 9 states. [2018-11-23 11:59:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:49,760 INFO L93 Difference]: Finished difference Result 5354 states and 6895 transitions. [2018-11-23 11:59:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:59:49,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-11-23 11:59:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:49,770 INFO L225 Difference]: With dead ends: 5354 [2018-11-23 11:59:49,771 INFO L226 Difference]: Without dead ends: 3443 [2018-11-23 11:59:49,775 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:59:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2018-11-23 11:59:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3292. [2018-11-23 11:59:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2018-11-23 11:59:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 4124 transitions. [2018-11-23 11:59:49,844 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 4124 transitions. Word has length 195 [2018-11-23 11:59:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:49,845 INFO L480 AbstractCegarLoop]: Abstraction has 3292 states and 4124 transitions. [2018-11-23 11:59:49,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:59:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 4124 transitions. [2018-11-23 11:59:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 11:59:49,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:49,853 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:49,853 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:49,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1302735996, now seen corresponding path program 1 times [2018-11-23 11:59:49,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:49,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:49,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 79 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:59:50,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:50,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:50,063 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-11-23 11:59:50,064 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:50,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:50,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:50,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:59:50,379 INFO L272 AbstractInterpreter]: Visited 127 different actions 508 times. Merged at 8 different actions 33 times. Widened at 1 different actions 1 times. Performed 7130 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7130 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-11-23 11:59:50,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:50,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:59:50,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:50,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:50,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:50,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:59:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:50,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-23 11:59:50,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:59:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 84 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:59:50,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:59:50,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-23 11:59:50,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:59:50,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:59:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:59:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:59:50,755 INFO L87 Difference]: Start difference. First operand 3292 states and 4124 transitions. Second operand 11 states. [2018-11-23 11:59:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:51,991 INFO L93 Difference]: Finished difference Result 11102 states and 14805 transitions. [2018-11-23 11:59:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:59:51,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-11-23 11:59:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:52,016 INFO L225 Difference]: With dead ends: 11102 [2018-11-23 11:59:52,016 INFO L226 Difference]: Without dead ends: 8227 [2018-11-23 11:59:52,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:59:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8227 states. [2018-11-23 11:59:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8227 to 8152. [2018-11-23 11:59:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8152 states. [2018-11-23 11:59:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8152 states to 8152 states and 10235 transitions. [2018-11-23 11:59:52,186 INFO L78 Accepts]: Start accepts. Automaton has 8152 states and 10235 transitions. Word has length 202 [2018-11-23 11:59:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:52,187 INFO L480 AbstractCegarLoop]: Abstraction has 8152 states and 10235 transitions. [2018-11-23 11:59:52,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:59:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 8152 states and 10235 transitions. [2018-11-23 11:59:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-23 11:59:52,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:52,201 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:52,202 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:52,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1598439036, now seen corresponding path program 1 times [2018-11-23 11:59:52,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:52,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:52,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:59:52,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:52,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:52,328 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-23 11:59:52,329 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:52,331 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:52,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:52,625 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 11:59:52,625 INFO L272 AbstractInterpreter]: Visited 126 different actions 370 times. Merged at 6 different actions 12 times. Never widened. Performed 4872 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-23 11:59:52,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:52,630 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 11:59:52,787 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 83.57% of their original sizes. [2018-11-23 11:59:52,787 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 11:59:52,835 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-23 11:59:52,835 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 11:59:52,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:59:52,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-23 11:59:52,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:59:52,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:59:52,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:59:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:52,836 INFO L87 Difference]: Start difference. First operand 8152 states and 10235 transitions. Second operand 9 states. [2018-11-23 11:59:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:54,337 INFO L93 Difference]: Finished difference Result 16439 states and 20715 transitions. [2018-11-23 11:59:54,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:59:54,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 211 [2018-11-23 11:59:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:54,363 INFO L225 Difference]: With dead ends: 16439 [2018-11-23 11:59:54,363 INFO L226 Difference]: Without dead ends: 8847 [2018-11-23 11:59:54,378 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:59:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8847 states. [2018-11-23 11:59:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8847 to 8706. [2018-11-23 11:59:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8706 states. [2018-11-23 11:59:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 10856 transitions. [2018-11-23 11:59:54,534 INFO L78 Accepts]: Start accepts. Automaton has 8706 states and 10856 transitions. Word has length 211 [2018-11-23 11:59:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:54,534 INFO L480 AbstractCegarLoop]: Abstraction has 8706 states and 10856 transitions. [2018-11-23 11:59:54,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:59:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 8706 states and 10856 transitions. [2018-11-23 11:59:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-23 11:59:54,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:54,546 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:54,546 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:54,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:54,547 INFO L82 PathProgramCache]: Analyzing trace with hash 631030518, now seen corresponding path program 1 times [2018-11-23 11:59:54,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:54,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:54,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 11:59:54,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:54,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:54,655 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-11-23 11:59:54,655 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:54,657 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:54,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:55,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:59:55,058 INFO L272 AbstractInterpreter]: Visited 127 different actions 499 times. Merged at 8 different actions 24 times. Never widened. Performed 7180 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7180 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-23 11:59:55,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:55,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:59:55,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:55,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:55,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:55,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:59:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:55,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 134 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-23 11:59:55,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:59:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 146 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-23 11:59:55,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:59:55,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-23 11:59:55,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:59:55,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:59:55,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:59:55,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:59:55,266 INFO L87 Difference]: Start difference. First operand 8706 states and 10856 transitions. Second operand 8 states. [2018-11-23 11:59:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:56,315 INFO L93 Difference]: Finished difference Result 17426 states and 22383 transitions. [2018-11-23 11:59:56,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:59:56,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-11-23 11:59:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:56,335 INFO L225 Difference]: With dead ends: 17426 [2018-11-23 11:59:56,335 INFO L226 Difference]: Without dead ends: 9834 [2018-11-23 11:59:56,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:59:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2018-11-23 11:59:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9215. [2018-11-23 11:59:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9215 states. [2018-11-23 11:59:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 11071 transitions. [2018-11-23 11:59:56,457 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 11071 transitions. Word has length 227 [2018-11-23 11:59:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:56,457 INFO L480 AbstractCegarLoop]: Abstraction has 9215 states and 11071 transitions. [2018-11-23 11:59:56,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:59:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 11071 transitions. [2018-11-23 11:59:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-23 11:59:56,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:56,466 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:56,466 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:56,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:56,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1225400414, now seen corresponding path program 1 times [2018-11-23 11:59:56,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:56,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:56,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 165 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 11:59:56,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:56,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:56,573 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-11-23 11:59:56,573 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:56,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:56,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:56,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:59:56,813 INFO L272 AbstractInterpreter]: Visited 127 different actions 507 times. Merged at 8 different actions 32 times. Widened at 1 different actions 1 times. Performed 7095 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7095 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-11-23 11:59:56,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:56,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:59:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:56,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:56,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:56,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:59:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:56,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-23 11:59:56,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:59:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-23 11:59:57,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:59:57,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2018-11-23 11:59:57,176 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:59:57,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:57,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:57,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:59:57,177 INFO L87 Difference]: Start difference. First operand 9215 states and 11071 transitions. Second operand 12 states. [2018-11-23 11:59:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:59,011 INFO L93 Difference]: Finished difference Result 17683 states and 22894 transitions. [2018-11-23 11:59:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:59:59,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 237 [2018-11-23 11:59:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:59,039 INFO L225 Difference]: With dead ends: 17683 [2018-11-23 11:59:59,039 INFO L226 Difference]: Without dead ends: 9437 [2018-11-23 11:59:59,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 491 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=418, Invalid=1652, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:59:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9437 states. [2018-11-23 11:59:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9437 to 8734. [2018-11-23 11:59:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8734 states. [2018-11-23 11:59:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8734 states to 8734 states and 10061 transitions. [2018-11-23 11:59:59,226 INFO L78 Accepts]: Start accepts. Automaton has 8734 states and 10061 transitions. Word has length 237 [2018-11-23 11:59:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:59,226 INFO L480 AbstractCegarLoop]: Abstraction has 8734 states and 10061 transitions. [2018-11-23 11:59:59,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:59:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 8734 states and 10061 transitions. [2018-11-23 11:59:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-23 11:59:59,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:59,236 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:59,236 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:59,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:59,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1307278761, now seen corresponding path program 1 times [2018-11-23 11:59:59,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:59:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:59,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:59,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:59:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 11:59:59,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:59,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:59:59,427 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-23 11:59:59,428 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 11:59:59,432 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:59:59,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:59:59,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:59:59,761 INFO L272 AbstractInterpreter]: Visited 128 different actions 638 times. Merged at 9 different actions 42 times. Never widened. Performed 8831 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8831 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 13 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-23 11:59:59,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:59,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:59:59,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:59,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:59:59,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:59,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:59:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:59,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-23 11:59:59,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:59:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-23 11:59:59,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:59:59,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-23 11:59:59,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:59:59,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:59:59,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:59:59,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:59:59,975 INFO L87 Difference]: Start difference. First operand 8734 states and 10061 transitions. Second operand 12 states. [2018-11-23 12:00:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:02,156 INFO L93 Difference]: Finished difference Result 17398 states and 20711 transitions. [2018-11-23 12:00:02,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:00:02,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 253 [2018-11-23 12:00:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:02,174 INFO L225 Difference]: With dead ends: 17398 [2018-11-23 12:00:02,174 INFO L226 Difference]: Without dead ends: 7480 [2018-11-23 12:00:02,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:00:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7480 states. [2018-11-23 12:00:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7480 to 5825. [2018-11-23 12:00:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2018-11-23 12:00:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 6437 transitions. [2018-11-23 12:00:02,294 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 6437 transitions. Word has length 253 [2018-11-23 12:00:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:02,294 INFO L480 AbstractCegarLoop]: Abstraction has 5825 states and 6437 transitions. [2018-11-23 12:00:02,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:00:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 6437 transitions. [2018-11-23 12:00:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-23 12:00:02,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:02,302 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:02,302 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:02,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1500745214, now seen corresponding path program 1 times [2018-11-23 12:00:02,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:00:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:02,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:02,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:00:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 229 proven. 112 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-23 12:00:02,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:02,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:00:02,443 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-11-23 12:00:02,444 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [37], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 12:00:02,447 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:00:02,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:00:02,786 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 12:00:02,786 INFO L272 AbstractInterpreter]: Visited 129 different actions 514 times. Merged at 10 different actions 31 times. Never widened. Performed 7310 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7310 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-23 12:00:02,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:02,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 12:00:02,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:02,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:02,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:02,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:00:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:02,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-11-23 12:00:02,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:00:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-11-23 12:00:02,990 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:00:02,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-23 12:00:02,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:00:02,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:00:02,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:00:02,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:00:02,991 INFO L87 Difference]: Start difference. First operand 5825 states and 6437 transitions. Second operand 3 states. [2018-11-23 12:00:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:03,225 INFO L93 Difference]: Finished difference Result 10812 states and 11991 transitions. [2018-11-23 12:00:03,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:00:03,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-11-23 12:00:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:03,236 INFO L225 Difference]: With dead ends: 10812 [2018-11-23 12:00:03,237 INFO L226 Difference]: Without dead ends: 5825 [2018-11-23 12:00:03,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 542 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:00:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5825 states. [2018-11-23 12:00:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5825 to 5552. [2018-11-23 12:00:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-11-23 12:00:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 6116 transitions. [2018-11-23 12:00:03,352 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 6116 transitions. Word has length 271 [2018-11-23 12:00:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:03,352 INFO L480 AbstractCegarLoop]: Abstraction has 5552 states and 6116 transitions. [2018-11-23 12:00:03,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:00:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 6116 transitions. [2018-11-23 12:00:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-23 12:00:03,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:03,359 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2018-11-23 12:00:03,359 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:03,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash 639701469, now seen corresponding path program 1 times [2018-11-23 12:00:03,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:00:03,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:03,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:03,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:03,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:00:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 256 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-23 12:00:03,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:03,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:00:03,514 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-11-23 12:00:03,515 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [37], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 12:00:03,519 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:00:03,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:00:03,853 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 12:00:03,853 INFO L272 AbstractInterpreter]: Visited 128 different actions 509 times. Merged at 8 different actions 30 times. Never widened. Performed 7166 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7166 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-11-23 12:00:03,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:03,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 12:00:03,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:03,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:00:03,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:03,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:00:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:03,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 256 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-23 12:00:03,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:00:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 256 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-23 12:00:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:00:04,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-23 12:00:04,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:00:04,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:00:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:00:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:00:04,068 INFO L87 Difference]: Start difference. First operand 5552 states and 6116 transitions. Second operand 9 states. [2018-11-23 12:00:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:04,497 INFO L93 Difference]: Finished difference Result 9165 states and 10206 transitions. [2018-11-23 12:00:04,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:00:04,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 275 [2018-11-23 12:00:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:04,497 INFO L225 Difference]: With dead ends: 9165 [2018-11-23 12:00:04,497 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:00:04,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 551 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:00:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:00:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:00:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:00:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:00:04,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2018-11-23 12:00:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:04,505 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:00:04,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:00:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:00:04,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:04,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:00:04,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:04,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,270 WARN L180 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 445 DAG size of output: 330 [2018-11-23 12:00:05,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:00:05,771 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 466 DAG size of output: 348 [2018-11-23 12:00:06,007 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2018-11-23 12:00:07,644 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 255 DAG size of output: 104 [2018-11-23 12:00:08,672 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 321 DAG size of output: 94 [2018-11-23 12:00:09,687 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 335 DAG size of output: 94 [2018-11-23 12:00:09,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:00:09,688 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a8~0 |old(~a8~0)|) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,689 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 518) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-23 12:00:09,690 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-23 12:00:09,691 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-23 12:00:09,692 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,693 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,694 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,695 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-23 12:00:09,696 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (<= ~a21~0 |old(~a21~0)|)) (.cse15 (= 1 ~a21~0)) (.cse4 (= |old(~a16~0)| ~a16~0)) (.cse14 (<= ~a8~0 |old(~a8~0)|)) (.cse5 (= ~a17~0 |old(~a17~0)|)) (.cse7 (= |old(~a7~0)| ~a7~0)) (.cse16 (<= |old(~a8~0)| ~a8~0)) (.cse8 (= ~a20~0 |old(~a20~0)|)) (.cse19 (= 1 |old(~a17~0)|)) (.cse25 (= 4 |old(~a16~0)|))) (let ((.cse2 (not .cse25)) (.cse24 (not (= 13 |old(~a8~0)|))) (.cse9 (not .cse19)) (.cse26 (< |old(~a20~0)| 1)) (.cse22 (< 0 |old(~a21~0)|)) (.cse21 (and .cse4 (= ~a21~0 |old(~a21~0)|) .cse14 .cse5 .cse7 .cse16 .cse8)) (.cse30 (< |old(~a8~0)| 15)) (.cse28 (< |old(~a8~0)| 14)) (.cse29 (and .cse4 .cse14 .cse5 .cse7 .cse16 .cse15 .cse8)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse11 (not (= 1 |old(~a21~0)|))) (.cse17 (= ~a20~0 1)) (.cse12 (= |calculate_output_#in~input| 0)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|))) (.cse27 (= 6 |old(~a16~0)|)) (.cse0 (= 1 |old(~a7~0)|)) (.cse18 (and .cse4 .cse14 .cse5 .cse6 .cse7 .cse8)) (.cse3 (not (= 8 ~a12~0))) (.cse20 (< 14 |old(~a8~0)|)) (.cse23 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse10 .cse11 .cse3 .cse12 .cse1 .cse13 (not (= 5 |old(~a16~0)|)) (and .cse14 .cse15 .cse5 .cse7 .cse16 .cse17 (= ~a16~0 5))) (or .cse0 .cse1 .cse18 .cse3 .cse19 .cse20) (or .cse21 (< 4 |old(~a16~0)|) .cse3 .cse20 .cse22 .cse23) (or .cse0 .cse18 .cse2 .cse3 .cse19 .cse20 .cse23) (or .cse11 .cse1 .cse2 .cse3 (and (= 13 ~a8~0) .cse15) .cse24 .cse9) (or .cse0 .cse25 .cse1 .cse18 .cse3 .cse20) (or .cse0 .cse25 .cse3 .cse26 .cse19 .cse20 .cse18) (or .cse27 .cse11 .cse25 .cse28 .cse29 .cse3 .cse19 .cse20) (or .cse11 .cse29 (or .cse0 .cse25 .cse1 .cse3 .cse19) .cse30) (or .cse11 .cse1 .cse2 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse4 (= 1 ~a17~0)) .cse3 (not .cse0) .cse24 .cse9) (or .cse25 .cse3 .cse26 .cse19 .cse20 .cse22 .cse21) (or (or .cse10 .cse11 .cse13 .cse3 .cse12 .cse23) .cse29) (or (or .cse27 .cse1 .cse3 .cse22) .cse21 .cse20) (or .cse27 .cse11 .cse0 .cse3 .cse29 .cse30 .cse23) (or .cse27 .cse11 .cse28 .cse29 .cse3 .cse19 .cse23) (or .cse10 .cse11 (and .cse4 .cse14 .cse15 .cse5 .cse7 .cse16 .cse17) .cse3 .cse12 .cse1 .cse13 .cse19) (or .cse27 .cse0 .cse25 .cse18 .cse3 .cse20 .cse23)))) [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-23 12:00:09,697 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,698 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-23 12:00:09,699 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-23 12:00:09,700 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-23 12:00:09,701 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-23 12:00:09,701 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-23 12:00:09,701 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-23 12:00:09,701 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:00:09,701 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= 1 ~a17~0) (= ~a16~0 5)) [2018-11-23 12:00:09,701 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:00:09,701 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:00:09,701 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (<= ~a8~0 |old(~a8~0)|) (= 1 ~a21~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 1) (= ~a16~0 5))) [2018-11-23 12:00:09,701 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-23 12:00:09,702 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= 14 ~a8~0)) (.cse10 (<= ~a8~0 |old(~a8~0)|)) (.cse11 (= ~a7~0 |old(~a7~0)|)) (.cse12 (= ~a20~0 |old(~a20~0)|)) (.cse9 (not (= main_~input~0 0))) (.cse7 (<= ~a20~0 0)) (.cse2 (= 1 ~a21~0)) (.cse16 (= |old(~a20~0)| ~a20~0)) (.cse13 (= 4 ~a16~0)) (.cse15 (= 1 ~a17~0)) (.cse14 (= 1 ~a20~0)) (.cse1 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse8 (not (= ~a7~0 1))) (.cse3 (not (= ~a17~0 1))) (.cse5 (not (= ~a16~0 4))) (.cse17 (<= 1 ~a20~0)) (.cse4 (<= ~a8~0 14))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 5 |old(~a16~0)|)) (and .cse6 .cse4 .cse7 (<= ~a16~0 4)) (and (and (and .cse8 .cse1 .cse5) .cse7) .cse4) (and .cse9 .cse3 .cse10 .cse11 .cse2 .cse12) (and (and (and .cse8 .cse1 .cse7) (<= 15 ~a8~0)) .cse2) (and (and .cse1 .cse3 .cse7) .cse0 .cse2) (and .cse9 .cse10 .cse11 .cse2 .cse12 (= ~a16~0 5)) (and (and .cse8 .cse13 .cse3 .cse7) .cse4) (and (= ~a7~0 0) .cse9 (= ~a8~0 15) (= ~a21~0 1) .cse7) (and .cse14 (= 13 ~a8~0) .cse13 .cse2 .cse15) (and .cse8 .cse16 .cse4) (and (and (and .cse8 .cse3 .cse5) .cse14) .cse2) (and .cse8 .cse16 .cse13 .cse15) (and .cse4 (and .cse6 .cse14 .cse1)) (and .cse6 .cse3 .cse4 .cse17 .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (and .cse8 .cse3 .cse5 .cse17) .cse4))) [2018-11-23 12:00:09,702 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-23 12:00:09,702 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-23 12:00:09,702 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (<= ~a8~0 |old(~a8~0)|)) (.cse9 (= ~a7~0 |old(~a7~0)|)) (.cse10 (= ~a20~0 |old(~a20~0)|)) (.cse0 (<= 14 ~a8~0)) (.cse7 (<= ~a20~0 0)) (.cse2 (= 1 ~a21~0)) (.cse15 (= |old(~a20~0)| ~a20~0)) (.cse12 (= 4 ~a16~0)) (.cse14 (= 1 ~a17~0)) (.cse13 (= 1 ~a20~0)) (.cse1 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse11 (not (= ~a7~0 1))) (.cse3 (not (= ~a17~0 1))) (.cse5 (not (= ~a16~0 4))) (.cse16 (<= 1 ~a20~0)) (.cse4 (<= ~a8~0 14))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 5 |old(~a16~0)|)) (and .cse6 .cse4 .cse7 (<= ~a16~0 4)) (and .cse8 .cse9 .cse2 .cse10 (= ~a16~0 5)) (and (and (and .cse11 .cse1 .cse5) .cse7) .cse4) (and (not (= main_~input~0 0)) .cse3 .cse8 .cse9 .cse2 .cse10) (and (and (and .cse11 .cse1 .cse7) (<= 15 ~a8~0)) .cse2) (and (and .cse1 .cse3 .cse7) .cse0 .cse2) (and (and (= ~a7~0 0) (= ~a8~0 15) .cse7) .cse2) (and (and .cse11 .cse12 .cse3 .cse7) .cse4) (and .cse13 (= 13 ~a8~0) .cse12 .cse2 .cse14) (and .cse11 .cse15 .cse4) (and (and (and .cse11 .cse3 .cse5) .cse13) .cse2) (and .cse11 .cse15 .cse12 .cse14) (and .cse4 (and .cse6 .cse13 .cse1)) (and .cse6 .cse3 .cse4 .cse16 .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (and .cse11 .cse3 .cse5 .cse16) .cse4))) [2018-11-23 12:00:09,702 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-11-23 12:00:09,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:00:09 BoogieIcfgContainer [2018-11-23 12:00:09,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:00:09,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:00:09,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:00:09,723 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:00:09,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:59:33" (3/4) ... [2018-11-23 12:00:09,726 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:00:09,741 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:00:09,741 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-23 12:00:09,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:00:09,754 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 12:00:09,754 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 12:00:09,780 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(1 == \old(a21)) || !(8 == a12)) || !(1 == \old(a20))) || (((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4))) || !(5 == \old(a16))) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((a8 <= \old(a8) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20)) && a16 == 5)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a16 == 4)) && a20 <= 0) && a8 <= 14)) || (((((!(input == 0) && !(a17 == 1)) && a8 <= \old(a8)) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20))) || ((((!(a7 == 1) && !(a16 == 6)) && a20 <= 0) && 15 <= a8) && 1 == a21)) || ((((!(a16 == 6) && !(a17 == 1)) && a20 <= 0) && 14 <= a8) && 1 == a21)) || (((a7 == 0 && a8 == 15) && a20 <= 0) && 1 == a21)) || ((((!(a7 == 1) && 4 == a16) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && a8 <= 14)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && 1 == a17)) || (a8 <= 14 && (a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((a21 <= 0 && !(a17 == 1)) && a8 <= 14) && 1 <= a20) && !(a16 == 4))) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20) && a8 <= 14) [2018-11-23 12:00:09,842 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_51c0c456-51dc-4103-b497-85ecf0842bbc/bin-2019/utaipan/witness.graphml [2018-11-23 12:00:09,843 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:00:09,843 INFO L168 Benchmark]: Toolchain (without parser) took 37263.73 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 956.4 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 660.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:00:09,844 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:00:09,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.17 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 918.9 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:00:09,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 918.9 MB in the beginning and 1.1 GB in the end (delta: -224.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:00:09,844 INFO L168 Benchmark]: Boogie Preprocessor took 49.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:00:09,844 INFO L168 Benchmark]: RCFGBuilder took 768.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:00:09,845 INFO L168 Benchmark]: TraceAbstraction took 35900.60 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-23 12:00:09,845 INFO L168 Benchmark]: Witness Printer took 119.79 ms. Allocated memory is still 3.0 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 51.3 kB). Peak memory consumption was 51.3 kB. Max. memory is 11.5 GB. [2018-11-23 12:00:09,847 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.17 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 918.9 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 918.9 MB in the beginning and 1.1 GB in the end (delta: -224.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 768.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35900.60 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 119.79 ms. Allocated memory is still 3.0 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 51.3 kB). Peak memory consumption was 51.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == \old(a21)) || !(8 == a12)) || !(1 == \old(a20))) || (((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4))) || !(5 == \old(a16))) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((a8 <= \old(a8) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20)) && a16 == 5)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a16 == 4)) && a20 <= 0) && a8 <= 14)) || (((((!(input == 0) && !(a17 == 1)) && a8 <= \old(a8)) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20))) || ((((!(a7 == 1) && !(a16 == 6)) && a20 <= 0) && 15 <= a8) && 1 == a21)) || ((((!(a16 == 6) && !(a17 == 1)) && a20 <= 0) && 14 <= a8) && 1 == a21)) || (((a7 == 0 && a8 == 15) && a20 <= 0) && 1 == a21)) || ((((!(a7 == 1) && 4 == a16) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && a8 <= 14)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && 1 == a17)) || (a8 <= 14 && (a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((a21 <= 0 && !(a17 == 1)) && a8 <= 14) && 1 <= a20) && !(a16 == 4))) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20) && a8 <= 14) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 35.8s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2001 SDtfs, 14633 SDslu, 2751 SDs, 0 SdLazy, 19835 SolverSat, 2985 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 4113 GetRequests, 3851 SyntacticMatches, 22 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9215occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9973427147774682 AbsIntWeakeningRatio, 0.21058558558558557 AbsIntAvgWeakeningVarsNumRemoved, 29.149774774774773 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 3662 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 411 PreInvPairs, 541 NumberOfFragments, 1496 HoareAnnotationTreeSize, 411 FomulaSimplifications, 59916 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 58165 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 4611 NumberOfCodeBlocks, 4611 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6047 ConstructedInterpolants, 0 QuantifiedInterpolants, 3052540 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3976 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 5093/5510 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...